On Unambiguous Nondeterministic Finite Automata and the Strict Tree Property.

On Unambiguous Nondeterministic Finite Automata and the Strict Tree Property.

In this paper, We intend to discuss the class of automata between deterministic finite automata (DFA) and unambiguous nondeterministic ñnite automata (UFA), which has the strict tree property. We call this class the Strict Unambiguous Finite Automata (StUFA)1. A reasonable characterization of these...

Celý popis

Podrobná bibliografie
Vydáno v:Philippine computing journal 3, 1(O) (2008).
Hlavní autor: Adorna, Henry
Další autoři: Hernandez, Nestine Hope S., Lorenzo, Rex Davis D.
Médium: Článek
Jazyk:English
Témata:
Automata.
Nondeterminìsm.
Computation tree.
Ambiguity.
On-line přístup:Available also online. Click here to access