Myhill-Nerode Theorem for Recognizable Tree Series Revisited

DOI10.1007/978-3-540-78773-0_10zbMath1137.68044OpenAlexW182772497MaRDI QIDQ5458521

Andreas Maletti

Publication date: 15 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_10

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (1)

Myhill-Nerode type theory for fuzzy languages and automata

Cites Work

• Equational elements in additive algebras
• On the Determinization of Weighted Finite Automata
• Implementation and Application of Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Myhill-Nerode Theorem for Recognizable Tree Series Revisited