Pages that link to "Item:Q4007371"
From MaRDI portal
The following pages link to An undecidable problem for countable markov chains (Q4007371):
Displayed 5 items.
- Equivalence problems for transducers with a bounded number of states (Q1280978) (← links)
- Solvability problems for \(ND\)-systems (Q1592108) (← links)
- Equivalence of transducers relative to regular languages (Q1816023) (← links)
- A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\) (Q1887138) (← links)
- Undecidability of the equivalence of finite substitutions on regular language (Q4265533) (← links)