Ambiguity, nondeterminism and state complexity of finite automata

Yo-Sub Han, Arto Salomaa, Kai Salomaa

Research output: Contribution to journalArticle

6 Citations (Scopus)

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.

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

Fingerprint

State Complexity
Nondeterminism
Finite Automata
Finite automata
Counting
Count
Leaves
Ambiguity

All Science Journal Classification (ASJC) codes

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

Cite this

Han, Yo-Sub ; Salomaa, Arto ; Salomaa, Kai. / Ambiguity, nondeterminism and state complexity of finite automata. In: Acta Cybernetica. 2017 ; Vol. 23, No. 1. pp. 141-157.
@article{308dc2fba48847b2aa1abd73a9a36d1c,
title = "Ambiguity, nondeterminism and state complexity of finite automata",
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.",
author = "Yo-Sub Han and Arto Salomaa and Kai Salomaa",
year = "2017",
month = "1",
day = "1",
doi = "10.14232/actacyb.23.1.2017.9",
language = "English",
volume = "23",
pages = "141--157",
journal = "Acta Cybernetica",
issn = "0324-721X",
publisher = "University of Szeged",
number = "1",

}

Ambiguity, nondeterminism and state complexity of finite automata. / Han, Yo-Sub; Salomaa, Arto; Salomaa, Kai.

In: Acta Cybernetica, Vol. 23, No. 1, 01.01.2017, p. 141-157.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Ambiguity, nondeterminism and state complexity of finite automata

AU - Han, Yo-Sub

AU - Salomaa, Arto

AU - Salomaa, Kai

PY - 2017/1/1

Y1 - 2017/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85020117486&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85020117486&partnerID=8YFLogxK

U2 - 10.14232/actacyb.23.1.2017.9

DO - 10.14232/actacyb.23.1.2017.9

M3 - Article

VL - 23

SP - 141

EP - 157

JO - Acta Cybernetica

JF - Acta Cybernetica

SN - 0324-721X

IS - 1

ER -