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