On probabilistic automata and their generalizations

Paavo Turakainen · Annales Academiae Scientiarum Fennicae Series A I Mathematica · 1969

I rttrrtrlu,ct'io'n, f)efinit,dans ancl notat'iotts (.'h ct,ptel" I .Proba,b'ilistic a,utornata, ouet" a one-lel,ter alphabet § l.Preliminary rernarks on stochastic matrices § 2. Lemmas § :].Three-state probabilistic automata § 1.An upper bound for the number of non-regular cr-rt-point,s § 5. Probabilistic automata and regular languages § 6. Proba,bilistic automata ancl non-regular languages

Read the paper · More papers on PaperTik