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

Volledige beschrijving

Bibliografische gegevens

Gepubliceerd in:	Philippine computing journal 3, 1(O) (2008).
Hoofdauteur:	Adorna, Henry
Andere auteurs:	Hernandez, Nestine Hope S., Lorenzo, Rex Davis D.
Formaat:	Artikel
Taal:	English
Onderwerpen:	Automata. Nondeterminìsm. Computation tree. Ambiguity.
Online toegang:	Available also online. Click here to access