Languages accepted by systolic \(Y\)-tree automata: Structural characterizations

DOI10.1007/BF01191895zbMath0790.68087MaRDI QIDQ1323359

Emanuela Fachini, Margherita Napoli, Domenico Parente, Angelo Monti

Publication date: 4 July 1994

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

decidabilityconcatenationundecidability resultsregular setssystolic systems\(Y\)-treesdeterministic systolic automatanondeterministic systolic automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Undecidability and degrees of sets of sentences (03D35) Cellular automata (computational aspects) (68Q80)

Related Items (2)

Power of interconnections and of nondeterminism in regularY-tree systolic automata ⋮ State complexity of SBTA languages

Cites Work

• On a family of L languages resulting from systolic tree automata
• Synthesis, structure and power of systolic computations
• C-tree systolic automata
• Systolic automata for VLSI on balanced trees
• Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata
• Systolic trellis automata: Stability, decidability and complexity
• Systolic trellis automatata †
• SYSTOLIC TREE WITH BASE AUTOMATA
• Power of interconnections and of nondeterminism in regularY-tree systolic automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Languages accepted by systolic \(Y\)-tree automata: Structural characterizations