An undecidable problem for countable markov chains

DOI10.1007/BF01068367zbMath0800.68581MaRDI QIDQ4007371

L. P. Lisovik

Publication date: 27 September 1992

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

undecidabilitystochastic automatacountable Markov chainnondeterministic defense system

Mathematics Subject Classification ID

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

Related Items (5)

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

Cites Work

• A note on Post's correspondence problem
• Intersection of finitely generated subgroups
• Minimal undecidable identity problem for finite-automaton mappings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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