Solution sets for equations over free groups are EDT0L languages
DOI10.1142/S0218196716500363zbMath1401.68156OpenAlexW2494564294MaRDI QIDQ2821818
Laura Ciobanu, Volker Diekert, Murray J. Elder
Publication date: 23 September 2016
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196716500363
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Algebraic geometry over groups; equations over groups (20F70)
Related Items (14)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- An efficient algorithm for solving word equations
- Recompression
- Solution Sets for Equations over Free Groups are EDT0L Languages
- Finding All Solutions of Equations in Free Groups and Monoids with Involution
This page was built for publication: Solution sets for equations over free groups are EDT0L languages