A Kleene-like characterization of languages accepted by systolic tree automata

DOI10.1016/S0022-0000(05)80090-XzbMath0821.68074MaRDI QIDQ1333404

Emanuela Fachini, Angelo Monti

Publication date: 10 September 1995

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

systolic binary tree automataKleen-like characterization

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Power of interconnections and of nondeterminism in regularY-tree systolic automata ⋮ Succinctness of descriptions of SBTA-languages ⋮ Completeness results concerning systolic tree automata and E0L languages

Cites Work

• On a family of L languages resulting from systolic tree automata
• Synthesis, structure and power of systolic computations
• A characterization of systolic binary tree automata and applications
• Systolic automata for VLSI on balanced trees
• Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata
• A characterization of context-free languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Kleene-like characterization of languages accepted by systolic tree automata