In automata theory, an unambiguous finite automaton (UFA) is a special kind of a nondeterministic finite automaton (NFA). Each deterministic finiteâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Christel Baier, Stefan Kiefer, Joachim Klein, Sascha KlÃ¼ppelholz, David MÃ¼ller, James Worrell
- CAV
- 2016

Unambiguous automata, i.e., nondeterministic automata with the restriction of having at most one accepting run over a word, haveâ€¦Â (More)

Is this relevant?

2015

2015

- Jacques Duparc, Kevin Fournier, Szczepan Hummel
- CSL
- 2015

Unambiguous automata are usually seen as a natural class of automata in-between deterministic and nondeterministic ones. We showâ€¦Â (More)

Is this relevant?

2012

2012

- Xiaoxue Piao, Kai Salomaa
- Theor. Comput. Sci.
- 2012

Tree automata operating on unranked trees use regular languages, called horizontal languages, to define the transitions of theâ€¦Â (More)

Is this relevant?

2010

2010

- Alexander Okhotin
- MFCS
- 2010

Nondeterministic finite automata (NFA) with at most one accepting computation on every input string are known as unambiguousâ€¦Â (More)

Is this relevant?

2004

2004

- Hing Leung
- DCFS
- 2004

In this paper, we study the tradeoffs in descriptional complexity of NFA (nondeterministic finite automata) of various amounts ofâ€¦Â (More)

Is this relevant?

1992

1992

- Sang Wan Cho, Dung T. Huynh
- Inf. Comput.
- 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?