For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
On Completeness of Automata
IEICE TRANSACTIONS on Information and Systems
Publication Date: 1998/11/25
Print ISSN: 0916-8532
Type of Manuscript: Category: Automata,Languages and Theory of Computing
automata, completeness, feedback connection,
Full Text: PDF>>
This letter reports on the condition for applying a feedback connection to a deterministic finite automata. First we define the partial delayed dependence condition for the feedback connection, and then consider problems related to the completeness problem of automata.