Classes of systolic y-tree automata and a comparison with systolic trellis automata:
Abstract: "In this paper we study Systolic Y-tree Automata (SYTA), a class of systolic automata where the communication structure is obtained by adding new edges, and therefore new sons, called adoptive sons, to the nodes of the underlying tree according to some regularity condition. We study S...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1991
|
| Schriftenreihe: | Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series
166 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In this paper we study Systolic Y-tree Automata (SYTA), a class of systolic automata where the communication structure is obtained by adding new edges, and therefore new sons, called adoptive sons, to the nodes of the underlying tree according to some regularity condition. We study SYTA in the more specific case where the tree is t-ary or a tree with base. We show that for each s[greater than or equal to]0 the set of classes of languages accepted by SYTA whose underlying tree is a tree with base with s leaves has a maximum, called LsSYTA. We study when LsSYTA is reached depending on number and position of the adoptive sons. We prove that if s and t are powers of the same base, then LsSYTA=LtSYTA We give also a simulation of SYTA on regular and modular systolic trellis automata, strengthening a previous result on simulation of systolic tree automata on systolic trellis automata. |
| Beschreibung: | 27 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009723709 | ||
| 003 | DE-604 | ||
| 005 | 19960711 | ||
| 007 | t | ||
| 008 | 940727s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)25838562 | ||
| 035 | |a (DE-599)BVBBV009723709 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Fachini, E. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Classes of systolic y-tree automata and a comparison with systolic trellis automata |c E. Fachini ; A. Maggiolo-Schettini ; Davide Sangiorgi |
| 264 | 1 | |a Edinburgh |c 1991 | |
| 300 | |a 27 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |v 166 | |
| 520 | 3 | |a Abstract: "In this paper we study Systolic Y-tree Automata (SYTA), a class of systolic automata where the communication structure is obtained by adding new edges, and therefore new sons, called adoptive sons, to the nodes of the underlying tree according to some regularity condition. We study SYTA in the more specific case where the tree is t-ary or a tree with base. We show that for each s[greater than or equal to]0 the set of classes of languages accepted by SYTA whose underlying tree is a tree with base with s leaves has a maximum, called LsSYTA. We study when LsSYTA is reached depending on number and position of the adoptive sons. We prove that if s and t are powers of the same base, then LsSYTA=LtSYTA | |
| 520 | 3 | |a We give also a simulation of SYTA on regular and modular systolic trellis automata, strengthening a previous result on simulation of systolic tree automata on systolic trellis automata. | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 7 | |a Mathematics |2 sigle | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Systolic array circuits | |
| 650 | 4 | |a Trees (Graph theory) | |
| 700 | 1 | |a Maggiolo-Schettini, Andrea |e Verfasser |4 aut | |
| 700 | 1 | |a Sangiorgi, Davide |e Verfasser |4 aut | |
| 830 | 0 | |a Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |v 166 |w (DE-604)BV008930032 |9 166 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006431301 | ||
Datensatz im Suchindex
| _version_ | 1804124070908788736 |
|---|---|
| any_adam_object | |
| author | Fachini, E. Maggiolo-Schettini, Andrea Sangiorgi, Davide |
| author_facet | Fachini, E. Maggiolo-Schettini, Andrea Sangiorgi, Davide |
| author_role | aut aut aut |
| author_sort | Fachini, E. |
| author_variant | e f ef a m s ams d s ds |
| building | Verbundindex |
| bvnumber | BV009723709 |
| ctrlnum | (OCoLC)25838562 (DE-599)BVBBV009723709 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02138nam a2200361 cb4500</leader><controlfield tag="001">BV009723709</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19960711 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940727s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25838562</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009723709</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Fachini, E.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Classes of systolic y-tree automata and a comparison with systolic trellis automata</subfield><subfield code="c">E. Fachini ; A. Maggiolo-Schettini ; Davide Sangiorgi</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">27 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series</subfield><subfield code="v">166</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this paper we study Systolic Y-tree Automata (SYTA), a class of systolic automata where the communication structure is obtained by adding new edges, and therefore new sons, called adoptive sons, to the nodes of the underlying tree according to some regularity condition. We study SYTA in the more specific case where the tree is t-ary or a tree with base. We show that for each s[greater than or equal to]0 the set of classes of languages accepted by SYTA whose underlying tree is a tree with base with s leaves has a maximum, called LsSYTA. We study when LsSYTA is reached depending on number and position of the adoptive sons. We prove that if s and t are powers of the same base, then LsSYTA=LtSYTA</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We give also a simulation of SYTA on regular and modular systolic trellis automata, strengthening a previous result on simulation of systolic tree automata on systolic trellis automata.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematics</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Systolic array circuits</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trees (Graph theory)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Maggiolo-Schettini, Andrea</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sangiorgi, Davide</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series</subfield><subfield code="v">166</subfield><subfield code="w">(DE-604)BV008930032</subfield><subfield code="9">166</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006431301</subfield></datafield></record></collection> |
| id | DE-604.BV009723709 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:39:49Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006431301 |
| oclc_num | 25838562 |
| open_access_boolean | |
| physical | 27 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series | Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |
| series2 | Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series |
| spelling | Fachini, E. Verfasser aut Classes of systolic y-tree automata and a comparison with systolic trellis automata E. Fachini ; A. Maggiolo-Schettini ; Davide Sangiorgi Edinburgh 1991 27 S. txt rdacontent n rdamedia nc rdacarrier Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series 166 Abstract: "In this paper we study Systolic Y-tree Automata (SYTA), a class of systolic automata where the communication structure is obtained by adding new edges, and therefore new sons, called adoptive sons, to the nodes of the underlying tree according to some regularity condition. We study SYTA in the more specific case where the tree is t-ary or a tree with base. We show that for each s[greater than or equal to]0 the set of classes of languages accepted by SYTA whose underlying tree is a tree with base with s leaves has a maximum, called LsSYTA. We study when LsSYTA is reached depending on number and position of the adoptive sons. We prove that if s and t are powers of the same base, then LsSYTA=LtSYTA We give also a simulation of SYTA on regular and modular systolic trellis automata, strengthening a previous result on simulation of systolic tree automata on systolic trellis automata. Computer software sigle Mathematics sigle Mathematik Systolic array circuits Trees (Graph theory) Maggiolo-Schettini, Andrea Verfasser aut Sangiorgi, Davide Verfasser aut Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series 166 (DE-604)BV008930032 166 |
| spellingShingle | Fachini, E. Maggiolo-Schettini, Andrea Sangiorgi, Davide Classes of systolic y-tree automata and a comparison with systolic trellis automata Laboratory for Foundations of Computer Science <Edinburgh>: LFCS report series Computer software sigle Mathematics sigle Mathematik Systolic array circuits Trees (Graph theory) |
| title | Classes of systolic y-tree automata and a comparison with systolic trellis automata |
| title_auth | Classes of systolic y-tree automata and a comparison with systolic trellis automata |
| title_exact_search | Classes of systolic y-tree automata and a comparison with systolic trellis automata |
| title_full | Classes of systolic y-tree automata and a comparison with systolic trellis automata E. Fachini ; A. Maggiolo-Schettini ; Davide Sangiorgi |
| title_fullStr | Classes of systolic y-tree automata and a comparison with systolic trellis automata E. Fachini ; A. Maggiolo-Schettini ; Davide Sangiorgi |
| title_full_unstemmed | Classes of systolic y-tree automata and a comparison with systolic trellis automata E. Fachini ; A. Maggiolo-Schettini ; Davide Sangiorgi |
| title_short | Classes of systolic y-tree automata and a comparison with systolic trellis automata |
| title_sort | classes of systolic y tree automata and a comparison with systolic trellis automata |
| topic | Computer software sigle Mathematics sigle Mathematik Systolic array circuits Trees (Graph theory) |
| topic_facet | Computer software Mathematics Mathematik Systolic array circuits Trees (Graph theory) |
| volume_link | (DE-604)BV008930032 |
| work_keys_str_mv | AT fachinie classesofsystolicytreeautomataandacomparisonwithsystolictrellisautomata AT maggioloschettiniandrea classesofsystolicytreeautomataandacomparisonwithsystolictrellisautomata AT sangiorgidavide classesofsystolicytreeautomataandacomparisonwithsystolictrellisautomata |