scientific article; zbMATH DE number 3339488
From MaRDI portal
Publication:5616207
zbMath0214.03903MaRDI QIDQ5616207
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Cancellation in context-free languages: enrichment by reduction ⋮ Solution Sets for Equations over Free Groups are EDT0L Languages ⋮ On a subclass of context-free groups ⋮ On the decidability of semigroup freeness ⋮ On regular trace languages ⋮ Thue systems as rewriting systems ⋮ Finding all solutions of equations in free groups and monoids with involution ⋮ Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages ⋮ On the rational subset problem for groups. ⋮ It is decidable whether a monadic thue system is canonical over a regular set ⋮ Submonoids and rational subsets of groups with infinitely many ends. ⋮ The fully compressed subgroup membership problem ⋮ Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two ⋮ Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank ⋮ On the transition graphs of Turing machines. ⋮ On the membership problem for finite automata over symmetric groups ⋮ No positive cone in a free product is regular ⋮ Tilings and submonoids of metabelian groups. ⋮ Computational power of two stacks with restricted communication ⋮ A group-theoretical interpretation of the word problem for free idempotent generated semigroups ⋮ Finite state automata: A geometric approach ⋮ Solutions to twisted word equations and equations in virtually free groups ⋮ Inverse monoids and rational Schreier subsets of the free group ⋮ Scott sentences for certain groups ⋮ The pro-nilpotent group topology on a free group ⋮ Two-letter group codes that preserve aperiodicity of inverse finite automata. ⋮ Inverse monoids and rational subsets of related groups ⋮ On one-relator monoids and one-relator groups ⋮ A list of applications of Stallings automata ⋮ Computing by commuting. ⋮ An automata theoretic approach to the generalized word problem in graphs of groups ⋮ On the complexity of some extended word problems defined by cancellation rules ⋮ Two problems for solvable and nilpotent groups ⋮ Undecidability of the word problem for one-relator inverse monoids via right-angled Artin subgroups of one-relator groups ⋮ New results on the prefix membership problem for one-relator groups ⋮ Deux applications de la représentation matricielle d'une série rationnelle non commutative. (Two applications of matrix representations of a rational non -commutative series) ⋮ Algorithmic properties of inverse monoids with hyperbolic and tree-like Schützenberger graphs ⋮ The existential theory of equations with rational constraints in free groups is PSPACE-complete ⋮ Solution of the membership problem of the prefix monoid in certain one-relator groups. ⋮ An application of the matrix representation of transductions ⋮ Rational subsets and submonoids of wreath products. ⋮ On one-relator groups and units of special one-relation inverse monoids ⋮ The finite power property in free groups
