C-tree systolic automata

DOI10.1016/0304-3975(88)90076-XMaRDI QIDQ1102750zbMATH OpenFDO

Authors Emanuela Fachini, Margherita Napoli

Publication date 1988

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(88)90076-X

zbMATH Keywords

Lindenmayer EPT0L languagessequential machinessystolic automaton

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Review text

A new type of systolic automaton is introduced, its structural properties such as homogeneity and stability, are investigated and the class of languages accepted by these automata is studied. This class of languages, in the nondeterministic case, contains a large subclass of the Lindenmayer EPT0L languages. A characterization of the defined model is also given in terms of sequential machines.

Recommendations

• scientific article; zbMATH DE number 3911718
• scientific article; zbMATH DE number 3898246
• Languages accepted by systolic \(Y\)-tree automata: Structural characterizations
• Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
• scientific article; zbMATH DE number 4126708

Cites work

• A characterization of systolic binary tree automata and applications
• Fundamental properties of infinite trees
• scientific article; zbMATH DE number 3911718 (Why is no real title available?)
• scientific article; zbMATH DE number 3569855 (Why is no real title available?)
• On a family of L languages resulting from systolic tree automata
• Systolic automata for VLSI on balanced trees
• Systolic trellis automatat†

Cited in

(15)

• Languages accepted by systolic \(Y\)-tree automata: Structural characterizations
• Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
• Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata
• Systolic automata and P systems
• SIMULATION OF SYSTOLIC TREE AUTOMATA ON TRELLIS AUTOMATA
• scientific article; zbMATH DE number 4215381 (Why is no real title available?)
• scientific article; zbMATH DE number 3898246 (Why is no real title available?)
• scientific article; zbMATH DE number 4094820 (Why is no real title available?)
• scientific article; zbMATH DE number 4108159 (Why is no real title available?)
• scientific article; zbMATH DE number 4126708 (Why is no real title available?)
• scientific article; zbMATH DE number 1836417 (Why is no real title available?)
• Power of interconnections and of nondeterminism in regularY-tree systolic automata
• State complexity of SBTA languages
• On a family of L languages resulting from systolic tree automata
• Synthesis, structure and power of systolic computations

This page was built for publication: C-tree systolic automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102750)