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

Disgrifiad llawn

Manylion Llyfryddiaeth

Cyhoeddwyd yn:	Philippine computing journal 3, 1(O) (2008).
Prif Awdur:	Adorna, Henry
Awduron Eraill:	Hernandez, Nestine Hope S., Lorenzo, Rex Davis D.
Fformat:	Erthygl
Iaith:	English
Pynciau:	Automata. Nondeterminìsm. Computation tree. Ambiguity.
Mynediad Ar-lein:	Available also online. Click here to access