Pages that link to "Item:Q5581637"
From MaRDI portal
The following pages link to Mappings induced by PGSM-mappings and some recursively unsolvable problems of finite probabilistic automata (Q5581637):
Displaying 4 items.
- Streaming algorithms for language recognition problems (Q391078) (← links)
- Decidability of ''Skolem matrix emptiness problem'' entails constructability of exact regular expression (Q1171048) (← links)
- On linear languages recognized by deterministic biautomata (Q2672654) (← links)
- On some constructions of grammars for linear languages (Q3732973) (← links)
