Ambiguity, nondeterminism and state complexity of finite automata

Yo Sub Han, Arto Salomaa, Kai Salomaa

Research output: Contribution to journalArticle

7 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)141-157
Number of pages17
JournalActa Cybernetica
Issue number1
Publication statusPublished - 2017 Jan 1

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Science (miscellaneous)
  • Computer Vision and Pattern Recognition
  • Management Science and Operations Research
  • Information Systems and Management
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Ambiguity, nondeterminism and state complexity of finite automata'. Together they form a unique fingerprint.

  • Cite this