scientific article; zbMATH DE number 3990879

zbMATH Open0612.68052MaRDI QIDQ3753495FDOQ3753495

Keijo Ruohonen

Publication date: 1986

Title of this publication is not available (Why is that?)

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

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)

Cited In (15)

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