Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata

DOI10.1016/0304-3975(91)90277-9zbMath0725.68060OpenAlexW1985499786MaRDI QIDQ2277854

D. Sangiori, Giovanni Resta, Emanuela Fachini, Andrea Maggiolo-Schettini

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90277-9

zbMATH Keywords

systolic tree automataclosure properties of language classes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Related Items (5)

A Kleene-like characterization of languages accepted by systolic tree automata ⋮ Systolic Automata and P Systems ⋮ Synthesis, structure and power of systolic computations ⋮ Completeness results concerning systolic tree automata and E0L languages ⋮ Languages accepted by systolic \(Y\)-tree automata: Structural characterizations

Cites Work

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

This page was built for publication: Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata