Equivalence of transducers relative to regular languages

DOI10.1007/BF02366629zbMath0868.68081MaRDI QIDQ1816023

L. P. Lisovik

Publication date: 21 November 1996

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

undecidabilityreliabilitynondeterministic protection systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Equivalence problems for transducers with a bounded number of states ⋮ Finite transducers and rational transductions ⋮ Solvability problems for \(ND\)-systems

Cites Work

• On some transducer equivalence problems for families of languages
• An undecidable problem for countable markov chains

This page was built for publication: Equivalence of transducers relative to regular languages