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.
ऑनलाइन पहुंच:	Available also online. Click here to access