Minimal undecidable identity problem for finite-automaton mappings

DOI10.1007/BF01072014zbMath0532.68058MaRDI QIDQ3315002

L. P. Lisovik

Publication date: 1983

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

decidabilityregular languagetransducer

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (3)

An undecidable problem for countable markov chains ⋮ Finite transducers and rational transductions ⋮ On the lengths of values in a finite transducer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
• A variant of a recursively unsolvable problem

This page was built for publication: Minimal undecidable identity problem for finite-automaton mappings