The expressibility of languages and relations by word equations
From MaRDI portal
Publication:4571943
DOI10.1007/3-540-63165-8_168zbMath1401.68163MaRDI 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
Related Items
Generalized factorizations of words and their algorithmic properties, Solving word equations modulo partial commutations
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