Representability of nonregular languages in finite probabilistic automata

DOI10.1016/S0019-9958(70)90149-XMaRDI QIDQ5592255zbMATH OpenFDO

Authors R. Knast

Publication date 1970

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(70)90149-X

zbMATH Keywords

languages, automata, networks

Cited in

(3)

• Probabilistic automata
• Theory of formal grammars
• Robert Knast (1940-1994)

This page was built for publication: Representability of nonregular languages in finite probabilistic automata

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