Mappings induced by PGSM-mappings and some recursively unsolvable problems of finite probabilistic automata
From MaRDI portal
Publication:5581637
DOI10.1016/S0019-9958(69)90449-5zbMath0188.03501MaRDI QIDQ5581637
Publication date: 1969
Published in: Information and Control (Search for Journal in Brave)
Related Items (4)
On some constructions of grammars for linear languages ⋮ Streaming algorithms for language recognition problems ⋮ On linear languages recognized by deterministic biautomata ⋮ Decidability of Skolem matrix emptiness problem entails constructability of exact regular expression
This page was built for publication: Mappings induced by PGSM-mappings and some recursively unsolvable problems of finite probabilistic automata
