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

Ful tanımlama

Detaylı Bibliyografya
Yayımlandı:Philippine computing journal 3, 1(O) (2008).
Yazar: Adorna, Henry
Diğer Yazarlar: Hernandez, Nestine Hope S., Lorenzo, Rex Davis D.
Materyal Türü: Makale
Dil:English
Konular:
Automata.
Nondeterminìsm.
Computation tree.
Ambiguity.
Online Erişim:Available also online. Click here to access