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

Descrición completa

Detalles Bibliográficos

Publicado en:	Philippine computing journal 3, 1(O) (2008).
Autor Principal:	Adorna, Henry
Outros autores:	Hernandez, Nestine Hope S., Lorenzo, Rex Davis D.
Formato:	Artigo
Idioma:	English
Subjects:	Automata. Nondeterminìsm. Computation tree. Ambiguity.
Acceso en liña:	Available also online. Click here to access