On Unambiguous Nondeterministic Finite Automata and the Strict Tree Property.

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

Deskribapen osoa

Xehetasun bibliografikoak
Argitaratua izan da:Philippine computing journal 3, 1(O) (2008).
Egile nagusia: Adorna, Henry
Beste egile batzuk: Hernandez, Nestine Hope S., Lorenzo, Rex Davis D.
Formatua: Artikulua
Hizkuntza:English
Gaiak:
Automata.
Nondeterminìsm.
Computation tree.
Ambiguity.
Sarrera elektronikoa:Available also online. Click here to access