On a representation of tree automata

DOI10.1016/0304-3975(87)90066-1zbMath0637.68061OpenAlexW2048810582WikidataQ127525934 ScholiaQ127525934MaRDI QIDQ1098636

Ferenc Gécseg, Zoltán Ésik

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90066-1

zbMATH Keywords

finite automatatree automataunary algebrasproducts of automata\(\alpha _ i\)- productshomomorphic representations

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Algebraic structures (08A99)

Related Items (2)

A decidability result for homomorphic representation of automata by \(\alpha _ 0\)-products ⋮ Critical classes for the \(\alpha _ 0\)-product

Cites Work

• Complete classes of automata for the \(\alpha _ 0\)-product
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a representation of tree automata