scientific article; zbMATH DE number 3990879

MaRDI QIDQ3753495zbMATH OpenFDO

Authors Keijo Ruohonen

Publication date 1986

zbMATH Keywords

surveyregular languagedecidabilitymetabelian groupsword morphismmonoid of endomorphismsL systemstrong morphical equivalence problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Algebraic theory of languages and automata (68Q70)

Recommendations

• scientific article; zbMATH DE number 1339972
• On the equivalence of some transductions involving letter to letter morphisms on regular languages
• scientific article; zbMATH DE number 777280
• scientific article; zbMATH DE number 3970124
• On some transducer equivalence problems for families of languages

Cited in

(15)

• Equality sets of binary D0L sequences
• Explicit test sets for iterated morphisms in free monoids and metabelian groups
• Streaming ranked-tree-to-string transducers
• Marked D0L systems and the \(2n\)-conjecture
• The language equivalence problem for HD0L systems having D0L growths
• A new bound for the D0L sequence equivalence problem
• A short solution for the HDT0L sequence equivalence problem
• The equational theory of regular words
• The equivalence problem for DF0L languages and power series.
• Morphisms fixing words associated with exchange of three intervals
• Easy cases of the D0L sequence equivalence problem
• D0L sequence equivalence is inPfor fixed alphabets
• scientific article; zbMATH DE number 777280 (Why is no real title available?)
• An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet
• Bounds for the D0L language equivalence problem

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 Q3753495)