Developments in Language Theory

DOI10.1007/B103739zbMATH Open1117.20314DBLPconf/dlt/2004OpenAlexW2496880349MaRDI QIDQ5711964

Markus Lohrey

Publication date: 22 December 2005

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

Full work available at URL: https://doi.org/10.1007/b103739

zbMATH Keywords

Cayley graphsword problemhyperbolic groupsfirst-order theoriesautomatic monoids

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Decidability of theories and sets of sentences (03B25) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Hyperbolic groups and nonpositively curved groups (20F67) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (3)

Unnamed Item ⋮ Incidence monoids: automorphisms and complexity ⋮ Automatic Decidability and Combinability Revisited

This page was built for publication: Developments in Language Theory