Ambiguity, nondeterminism and state complexity of finite automata

Han, Yo-Sub and Salomaa, Arto and Salomaa, Kai: Ambiguity, nondeterminism and state complexity of finite automata. Acta cybernetica, (23) 1. pp. 141-157. (2017)

[img] Cikk, tanulmány, mű

Download (363kB)


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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2017
Volume: 23
Number: 1
Page Range: pp. 141-157
ISSN: 0324-721X
Uncontrolled Keywords: Automaták elmélete - véges, Algebra, Véges automaták, Matematikai logika
Additional Information: Bibliogr.: p. 154-157. és a lábjegyzetekben
Date Deposited: 2018. Feb. 12. 09:19
Last Modified: 2018. Jun. 07. 11:27

Actions (login required)

View Item View Item