Abstract
In this paper the necessary and sufficient conditions of representability of nonregular languages in finite probabilistic automata are formulated.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
