An undecidable problem for countable markov chains

DOI10.1007/BF01068367MaRDI QIDQ4007371zbMATH OpenFDO

Authors L. P. Lisovik

Publication date 27 September 1992

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01068367

zbMATH Keywords

countable Markov chainnondeterministic defense systemstochastic automataundecidability

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Formal languages and automata (68Q45)

Cites work

• A note on Post's correspondence problem
• scientific article; zbMATH DE number 4097336 (Why is no real title available?)
• scientific article; zbMATH DE number 3746442 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• scientific article; zbMATH DE number 3301426 (Why is no real title available?)
• Intersection of finitely generated subgroups
• Minimal undecidable identity problem for finite-automaton mappings

Cited in

(5)

• Equivalence problems for transducers with a bounded number of states
• Solvability problems for \(ND\)-systems
• Equivalence of transducers relative to regular languages
• A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\)
• Undecidability of the equivalence of finite substitutions on regular language

This page was built for publication: An undecidable problem for countable markov chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4007371)