| C04-1011 | grammars by means of probabilistic | nite automata | . 2 Preliminaries Throughout |
| C04-1011 | context-free grammar and a probabilistic | nite automaton | . We show that there is a closed-form |
| C04-1013 | language . Since determinisation of | nite automata | can cause exponential blow ups |
| C04-1013 | : : : ; Hk be the sequence of | nite automata | , the states labelled with multisets |
| P91-1042 | testing the equivalence of - fi - | nite automata | -LSB- Hoperoft/Karp 71 -RSB- |
| C04-1011 | ` in nite ' deriva - tions . A | nite automaton | ( FA ) is a 5-tuple M = ( ; Q |
| C04-1011 | 2 Q and a 2 . A probabilistic | nite automaton | ( PFA ) is a pair Mp = ( M ; |
