On a family of L languages resulting from systolic tree automata

DOI10.1016/0304-3975(83)90032-4zbMath0549.68081OpenAlexW2081564114MaRDI QIDQ800102

Arto Salomaa, Karel II Culik, Jozef Gruska

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0304-3975(83)90032-4

zbMATH Keywords

formal power seriesemptiness problemBT-VLSI languagesEOL languagesystolic tree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (15)

A Kleene-like characterization of languages accepted by systolic tree automata ⋮ Syntactic monoids in the construction of systolic tree automata ⋮ A note on emptiness for alternating finite automata with a one-letter alphabet ⋮ C-tree systolic automata ⋮ Power of interconnections and of nondeterminism in regularY-tree systolic automata ⋮ Systolic Automata and P Systems ⋮ Succinctness of descriptions of SBTA-languages ⋮ Synthesis, structure and power of systolic computations ⋮ Systolic trees and systolic language recognition by tree automata ⋮ Completeness results concerning systolic tree automata and E0L languages ⋮ Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata ⋮ A characterization of systolic binary tree automata and applications ⋮ A systolic array for the longest common subsequence problem ⋮ Languages accepted by systolic \(Y\)-tree automata: Structural characterizations ⋮ Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata

Cites Work

• Systolic automata for VLSI on balanced trees
• Systolic trellis automatat†
• On some families of languages related to developmental systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a family of L languages resulting from systolic tree automata