scientific article; zbMATH DE number 848082
From MaRDI portal
Publication:4867134
automataautomatic groupscontext-free languagesformal languagesgeneratorsgrammarsrational languagesrelationsstack automataword problem
Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Geometric group theory (20F65) Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)
Recommendations
Cited in
(44)- Group presentations, formal languages and characterizations of one- counter groups
- Closedness of a class of groups under free product
- Word problems of groups: formal languages, characterizations and decidability
- The complexity of verbal languages over groups
- Rationality of verbal subsets in solvable groups
- From automatic structures to automatic groups.
- Two problems for solvable and nilpotent groups
- On the word problem for special monoids
- Groups whose word problems are not semilinear
- On rationality of verbal subsets in a group
- Word problems recognisable by deterministic blind monoid automata
- Cone types and geodesic languages for lamplighter groups and Thompson's group \(F\).
- Context-sensitive languages and G-automata
- The complexity of verbal languages over groups
- scientific article; zbMATH DE number 988812 (Why is no real title available?)
- Growth and ergodicity of context-free languages
- scientific article; zbMATH DE number 3887910 (Why is no real title available?)
- Polycyclic and Bicyclic Valence Automata
- Formal Languages and Groups as Memory
- scientific article; zbMATH DE number 4028927 (Why is no real title available?)
- Finiteness Conditions on Subgroups and Formal Language Theory
- scientific article; zbMATH DE number 1283959 (Why is no real title available?)
- Groups, graphs, languages, automata, games and second-order monadic logic
- Polycyclic, metabelian or soluble of type \((\mathrm{FP})_\infty\) groups with Boolean algebra of rational sets and biautomatic soluble groups are virtually abelian
- Applications of L systems to group theory
- Normal Forms for Basis-Conjugating Automorphisms of a Free Group
- scientific article; zbMATH DE number 7444014 (Why is no real title available?)
- Superpositions of free Fox derivations
- EXTENDED FINITE AUTOMATA AND WORD PROBLEMS
- A context-free and a 1-counter geodesic language for a Baumslag-Solitar group
- scientific article; zbMATH DE number 2221698 (Why is no real title available?)
- On groups whose word problem is solved by a counter automaton.
- Submonoids and rational subsets of groups with infinitely many ends.
- Undecidability of the submonoid membership problem for free nilpotent group of class l\geqslant 2 of sufficiently large rank
- Tilings and submonoids of metabelian groups.
- Languages and automata. GAGTA book 3
- Solvability of equations in classes of solvable groups and Lie algebras
- The theory of reachability of trace-pushdown systems
- On decidability of the product of subgroups membership problem for nilpotent groups
- Subsets of groups in public-key cryptography
- Reachability in trace-pushdown systems
- On the rational subset problem for groups.
- The submonoid and rational subset membership problems for graph groups.
- A course in formal languages, automata and groups
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4867134)
