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

ver descrição completa

Detalhes bibliográficos

Publicado no:	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
Assuntos:	Automata. Nondeterminìsm. Computation tree. Ambiguity.
Acesso em linha:	Available also online. Click here to access