Unambiguous finite automaton

Known as: Unambiguous automata, Unambiguous automaton, Unambiguous finite automata 
In automata theory, an unambiguous finite automaton (UFA) is a special kind of a nondeterministic finite automaton (NFA). Each deterministic finite… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1992-2015
0119922015

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Unambiguous automata, i.e., nondeterministic automata with the restriction of having at most one accepting run over a word, have… (More)
  • figure 1
  • table 1
Is this relevant?
2015
2015
Unambiguous automata are usually seen as a natural class of automata in-between deterministic and nondeterministic ones. We show… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Tree automata operating on unranked trees use regular languages, called horizontal languages, to define the transitions of the… (More)
  • figure 1
Is this relevant?
2010
2010
Nondeterministic finite automata (NFA) with at most one accepting computation on every input string are known as unambiguous… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
2004
2004
In this paper, we study the tradeoffs in descriptional complexity of NFA (nondeterministic finite automata) of various amounts of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1992
1992
The goal of this paper is to study the exact complexity of several important problems concerning finite-state automata and to… (More)
Is this relevant?