scientific article; zbMATH DE number 3381862
From MaRDI portal
Publication:5652216
zbMATH Open0241.68034MaRDI QIDQ5652216FDOQ5652216
Authors: Anatoly V. Anisimov 
Publication date: 1971
Title of this publication is not available (Why is that?)
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Cited In (35)
- Self-avoiding walks and multiple context-free languages
- Non-finitely generated maximal subgroups of context-free monoids
- Regular left-orders on groups
- Groups with context-free Diophantine problem
- On the word problem for special monoids
- On the rational subsets of the free group
- On a subclass of context-free groups
- Context-free pairs of groups. I: Context-free pairs and graphs
- On the word problem for free products of semigroups and monoids
- The complexity of Grigorchuk groups with application to cryptography
- Groups, the theory of ends, and context-free languages
- An effective version of Stallings' theorem in the case of context-free groups
- The Bounded and Precise Word Problems for Presentations of Groups
- The word problem of \(\mathbb{Z}^n\) is a multiple context-free language
- The (nested) word problem
- Group presentations, formal languages and characterizations of one- counter groups
- Recursive information transducers: Computation models
- Groups and NTS languages
- Groups, graphs, languages, automata, games and second-order monadic logic
- Cogrowth series for free products of finite groups
- Limits of Baumslag-Solitar groups and dimension estimates in the space of marked groups.
- Automorphism groups of context-free graphs
- Tree languages and branched groups
- Self-avoiding walks on Cayley graphs through the lens of symbolic dynamics
- Groups whose word problems are not semilinear
- On a kind of Fatou property of context-free groups
- On the complexity of the cogrowth sequence
- MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS
- EDT0L solutions to equations in group extensions
- The language of self-avoiding walks
- Multipass automata and group word problems
- On the word problem for weakly compressible monoids
- Word problems of groups: formal languages, characterizations and decidability
- Free products of semigroups and monoids with a deterministic context-free word problem
- On a class of poly-context-free groups generated by automata
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 Q5652216)
