Groups whose word problems are accepted by abelian \(G\)-automata
From MaRDI portal
Publication:6067344
DOI10.1007/978-3-031-33264-7_20OpenAlexW4377081635MaRDI QIDQ6067344
Publication date: 16 November 2023
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-33264-7_20
Cites Work
- Unnamed Item
- Unnamed Item
- Multipass automata and group word problems
- On groups whose word problem is solved by a counter automaton.
- Groups, the theory of ends, and context-free languages
- The accessibility of finitely presented groups
- Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
- Remarks on the complexity of nondeterministic counter languages
- Remarks on blind and partially blind one-way multicounter machines
- \(O_n\) is an \(n\)-MCFL
- Groups with poly-context-free word problem.
- Closure properties in the class of multiple context-free groups
- Groups whose word problems are not semilinear
- Word problems recognisable by deterministic blind monoid automata
- On the word problem for free products of semigroups and monoids
- FINITE AUTOMATA OVER FREE GROUPS
- Subgroups of finitely presented groups
- GROUPS WITH INDEXED CO-WORD PROBLEM
- Polycyclic and Bicyclic Valence Automata
- ON GROUPS AND COUNTER AUTOMATA
- Formal Languages and Groups as Memory
- An algebraic characterization of groups with soluble word problem
- EXTENDED FINITE AUTOMATA AND WORD PROBLEMS
- GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM
- GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM
- Groups Whose Word Problem is a Petri Net Language
- Ordering by Divisibility in Abstract Algebras
- Groups Covered By Permutable Subsets
- Extended finite automata over groups
This page was built for publication: Groups whose word problems are accepted by abelian \(G\)-automata
