A1 Refereed original research article in a scientific journal
Ambiguity, Nondeterminism and State Complexity of Finite Automata
Authors: Yo-Sub Han, Arto Salomaa, Kai Salomaa
Publisher: UNIV SZEGED, FAC SCIENCE
Publication year: 2017
Journal: Acta Cybernetica
Journal name in source: ACTA CYBERNETICA
Journal acronym: ACTA CYBERN
Volume: 23
Issue: 1
First page : 141
Last page: 157
Number of pages: 17
ISSN: 0324-721X
DOI: https://doi.org/10.14232/actacyb.23.1.2017.9
Abstract
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.
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.
UTU Research Portal