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

Popoln opis

Bibliografske podrobnosti
izdano v:Philippine computing journal 3, 1(O) (2008).
Glavni avtor: Adorna, Henry
Drugi avtorji: Hernandez, Nestine Hope S., Lorenzo, Rex Davis D.
Format: Article
Jezik:English
Teme:
Automata.
Nondeterminìsm.
Computation tree.
Ambiguity.
Online dostop:Available also online. Click here to access