Ambiguity, nondeterminism and state complexity of finite automata
The degree of ambiguity counts the number of accepting computations of a nondeterministic finite automaton (NFA) on a given input. Alternatively, the nondeterminism of an NFA can be measured by counting the amount of guessing in a single computation or the number of leaves of the computation tree on...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2017
|
| Sorozat: | Acta cybernetica
23 No. 1 |
| Kulcsszavak: | Automaták elmélete - véges, Algebra, Véges automaták, Matematikai logika |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.23.1.2017.9 |
| Online Access: | http://acta.bibl.u-szeged.hu/50067 |
| Tartalmi kivonat: | The degree of ambiguity counts the number of accepting computations of a nondeterministic finite automaton (NFA) on a given input. Alternatively, the nondeterminism of an NFA can be measured by counting the amount of guessing in a single computation or the number of leaves of the computation tree on a given input. This paper surveys work on the degree of ambiguity and on various nondeterminism measures for finite automata. In particular, we focus on state complexity comparisons between NFAs with quantified ambiguity or nondeterminism. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 141-157 |
| ISSN: | 0324-721X |