The expressibility of languages and relations by word equations

DOI10.1007/3-540-63165-8_168zbMath1401.68163OpenAlexW1883384169MaRDI QIDQ4571943

Filippo Mignosi, Juhani Karhumäki, Wojciech Plandowski

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_168

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items

Solving word equations modulo partial commutations ⋮ Generalized factorizations of words and their algorithmic properties

Cites Work

• Systems of equations over a free monoid and Ehrenfeucht's conjecture
• A proof of Ehrenfeucht's conjecture
• Equivalence of infinite systems of equations in free groups and semigroups to finite subsystems
• Equations in free semigroups
• Decision problems for patterns
• Coding in the existential theory of concatenation
• Complexity of Makanin's algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item