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

Descripció completa

Dades bibliogràfiques

Publicat a:	Philippine computing journal 3, 1(O) (2008).
Autor principal:	Adorna, Henry
Altres autors:	Hernandez, Nestine Hope S., Lorenzo, Rex Davis D.
Format:	Article
Idioma:	English
Matèries:	Automata. Nondeterminìsm. Computation tree. Ambiguity.
Accés en línia:	Available also online. Click here to access