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ón completa

Detalles Bibliográficos

Publicado en:	Philippine computing journal 3, 1(O) (2008).
Autor principal:	Adorna, Henry
Otros Autores:	Hernandez, Nestine Hope S., Lorenzo, Rex Davis D.
Formato:	Artículo
Lenguaje:	English
Materias:	Automata. Nondeterminìsm. Computation tree. Ambiguity.
Acceso en línea:	Available also online. Click here to access