scientific article
From MaRDI portal
Publication:3753495
zbMath0612.68052MaRDI QIDQ3753495
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveydecidabilityregular languagemetabelian groupsword morphismmonoid of endomorphismsL systemstrong morphical equivalence problem
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Grammars and rewriting systems (68Q42)
Related Items (12)
The equivalence problem for DF0L languages and power series. ⋮ Equality sets of binary D0L sequences ⋮ A new bound for the D0L sequence equivalence problem ⋮ Bounds for the D0L language equivalence problem ⋮ D0L sequence equivalence is inPfor fixed alphabets ⋮ Marked D0L systems and the \(2n\)-conjecture ⋮ The language equivalence problem for HD0L systems having D0L growths ⋮ Explicit test sets for iterated morphisms in free monoids and metabelian groups ⋮ Easy cases of the D0L sequence equivalence problem ⋮ Streaming ranked-tree-to-string transducers ⋮ A short solution for the HDT0L sequence equivalence problem ⋮ An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet
This page was built for publication:
