Systems of equations over a finite set of words and automata theory

DOI10.1007/3-540-55124-7_12zbMath1518.68218OpenAlexW1536966468MaRDI QIDQ6114515

Juhani Karhumäki

Publication date: 14 August 2023

Published in: Word Equations and Related Topics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55124-7_12

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equivalence problem of multitape finite automata
• The equivalence of finite valued transducers (on HDT0L languages) is decidable
• Equations in free semigroups
• The decidability of the equivalence problem for DOL-systems
• Codes conjugués

This page was built for publication: Systems of equations over a finite set of words and automata theory