Word problems of groups: formal languages, characterizations and decidability
From MaRDI portal
Publication:1623276
DOI10.1016/j.tcs.2018.05.007zbMath1403.68117OpenAlexW2802966894MaRDI QIDQ1623276
Sam A. M. Jones, Richard M. Thomas
Publication date: 23 November 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2381/42543
Formal languages and automata (68Q45) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Groups and NTS languages
- Groups, the theory of ends, and context-free languages
- A course in formal languages, automata and groups
- The accessibility of finitely presented groups
- The theory of ends, pushdown automata, and second-order logic
- Eine neue Invariante für kontextfreie Sprachen
- Petri nets and regular languages
- On the Hotz group of a context-free grammar
- Group presentations, formal languages and characterizations of one- counter groups
- \(L(A)=L(B)\)? decidability results from complete formal systems
- Groups, Languages and Automata
- Formal languages and group theory
- GROUPS WITH CONTEXT-FREE REDUCED WORD PROBLEM
- Hotz-isomorphism theorems in formal language theory
- Restricted one-counter machines with undecidable universe problems
- On a subclass of context-free groups
- On semigroup presentations
- Algebraic Theory of Automata and Languages
- Space Complexity and Word Problems of Groups
- GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM
- Some Remarks on Semigroup Presentations
- Ordering by Divisibility in Abstract Algebras
This page was built for publication: Word problems of groups: formal languages, characterizations and decidability
