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