scientific article; zbMATH DE number 3633742
From MaRDI portal
Publication:4194484
zbMath0407.68077MaRDI QIDQ4194484
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
LanguagesDecidabilityMorphismsContext-FreeFree MonoidRegularRecursively Enumerable LanguageContext-SensitiveDol Equivalence ProblemEquality Sets
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items
Ambiguity of Morphisms in a Free Group, Balance of many-valued transductions and equivalence problems, Representations of language families by homomorphic equality operations and generalized equality sets, A representation of recursively enumerable languages by two homomorphisms and a quotient, Multiple equality sets and Post machines, Equalizers and kernels in categories of monoids, 2DST mappings of languages and related problems, Large Simple Binary Equality Words, The (generalized) Post correspondence problem with lists consisting of two words is decidable, A note on morphic characterization of languages, Sticker systems, Reachability via Cooperating Morphisms, Finite transducers and rational transductions, On some decidability questions concerning supports of rational series, On binary equality sets and a solution to the test set conjecture in the binary case, The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids, Unambiguous injective morphisms in free groups, Binary equality sets are generated by two words
