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

Szczegółowa specyfikacja

Opis bibliograficzny

Wydane w:	Philippine computing journal 3, 1(O) (2008).
1. autor:	Adorna, Henry
Kolejni autorzy:	Hernandez, Nestine Hope S., Lorenzo, Rex Davis D.
Format:	Artykuł
Język:	English
Hasła przedmiotowe:	Automata. Nondeterminìsm. Computation tree. Ambiguity.
Dostęp online:	Available also online. Click here to access