Decidability problems for unary output sequential transducers

DOI10.1016/0166-218X(91)90096-FzbMath0743.68098OpenAlexW1988398776MaRDI QIDQ1179182

H. C. M. Kleijn, Tero J.Harju

Publication date: 26 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(91)90096-f

zbMATH Keywords

decidabilitysequential transducersmorphic composition

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Representation of rational functions with prefix and suffix codings ⋮ Compositional representation of rational functions ⋮ Identities and transductions ⋮ Finite transducers and rational transductions

Cites Work

• A note on morphic characterization of languages
• A homomorphic characterization of principal semi AFLs without using intersection with regular sets
• A new normal form for the compositions of morphisms and inverse morphisms
• The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item