C-tree systolic automata

DOI10.1016/0304-3975(88)90076-XzbMath0644.68081MaRDI QIDQ1102750

Margherita Napoli, Emanuela Fachini

Publication date: 1988

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

zbMATH Keywords

sequential machinesLindenmayer EPT0L languagessystolic automaton

Mathematics Subject Classification ID

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

Related Items

Power of interconnections and of nondeterminism in regularY-tree systolic automata ⋮ State complexity of SBTA languages ⋮ Synthesis, structure and power of systolic computations ⋮ Languages accepted by systolic \(Y\)-tree automata: Structural characterizations ⋮ Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata

Cites Work

• Unnamed Item
• Unnamed Item
• On a family of L languages resulting from systolic tree automata
• Fundamental properties of infinite trees
• A characterization of systolic binary tree automata and applications
• Systolic automata for VLSI on balanced trees
• Systolic trellis automatat†