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