scientific article; zbMATH DE number 3381862

zbMath0241.68034MaRDI QIDQ5652216

Anatoly V. Anisimov

Publication date: 1971

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (32)

Self-avoiding walks and multiple context-free languages ⋮ Word problems of groups: formal languages, characterizations and decidability ⋮ The (nested) word problem ⋮ On a subclass of context-free groups ⋮ The word problem of \(\mathbb{Z}^n\) is a multiple context-free language ⋮ On the word problem for special monoids ⋮ The language of self-avoiding walks ⋮ On the rational subsets of the free group ⋮ On the complexity of the cogrowth sequence ⋮ Cogrowth series for free products of finite groups ⋮ MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS ⋮ On the word problem for weakly compressible monoids ⋮ EDT0L solutions to equations in group extensions ⋮ The Bounded and Precise Word Problems for Presentations of Groups ⋮ On the word problem for free products of semigroups and monoids ⋮ Tree languages and branched groups ⋮ Groups, graphs, languages, automata, games and second-order monadic logic ⋮ Context-free pairs of groups. I: Context-free pairs and graphs ⋮ On a class of poly-context-free groups generated by automata ⋮ Limits of Baumslag-Solitar groups and dimension estimates in the space of marked groups. ⋮ An effective version of Stallings' theorem in the case of context-free groups ⋮ The complexity of Grigorchuk groups with application to cryptography ⋮ Multipass automata and group word problems ⋮ On a kind of Fatou property of context-free groups ⋮ Automorphism groups of context-free graphs ⋮ Group presentations, formal languages and characterizations of one- counter groups ⋮ Groups and NTS languages ⋮ Groups whose word problems are not semilinear ⋮ Recursive information transducers: Computation models ⋮ Groups, the theory of ends, and context-free languages ⋮ Non-finitely generated maximal subgroups of context-free monoids ⋮ Regular left-orders on groups

This page was built for publication: