Syntactic monoids in the construction of systolic tree automata

DOI10.1007/BF00990900zbMath0582.68048OpenAlexW2030334805MaRDI QIDQ3704911

Helmut Jürgensen, Arto Salomaa

Publication date: 1985

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00990900

zbMATH Keywords

minimization problemsregular language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (2)

Succinctness of descriptions of SBTA-languages ⋮ Synthesis, structure and power of systolic computations

Cites Work

• Unnamed Item
• Unnamed Item
• On a family of L languages resulting from systolic tree automata
• Monoids with disjunctive identity and their codes
• Systolic automata for VLSI on balanced trees
• Systolic trees and systolic language recognition by tree automata
• Programmable finite automata for VLSI†

This page was built for publication: Syntactic monoids in the construction of systolic tree automata