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

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής

Τόπος έκδοσης:	Philippine computing journal 3, 1(O) (2008).
Κύριος συγγραφέας:	Adorna, Henry
Άλλοι συγγραφείς:	Hernandez, Nestine Hope S., Lorenzo, Rex Davis D.
Μορφή:	Άρθρο
Γλώσσα:	English
Θέματα:	Automata. Nondeterminìsm. Computation tree. Ambiguity.
Διαθέσιμο Online:	Available also online. Click here to access