Abstract
The class of mod- p linear probabilistic automata are defined. It is shown that mod-2 linear probabilistic automata driven by a single binomial process define regular languages for all cut-points, and that mod-3 linear probabilistic automata driven by a single trinomial process may define nonregular languages. It is also shown that mod-2 linear probabilistic automata driven by any number of binomial processes may define nonregular languages for only a finite number of cut-points.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
