IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Special Section on Discrete Mathematics and Its Applications
A Note on Cooperating Systems of One-Way Alternating Finite Automata with Only Universal States
Tatsuya FUJIMOTOTsunehiro YOSHINAGAMakoto SAKAMOTO
Author information
JOURNALS RESTRICTED ACCESS

2014 Volume E97.A Issue 6 Pages 1375-1377

Details
Abstract

A cooperating system of finite automata (CS-FA) has more than one finite automata (FA's) and an input tape. These FA's operate independently on the input tape and can communicate with each other on the same cell of the input tape. For each k ≥ 1, let L[CS-1DFA(k)] (L[CS-1UFA(k)]) be the class of sets accepted by CS-FA's with k one-way deterministic finite automata (alternating finite automata with only universal states). We show that L[CS-1DFA(k+1)] - L[CS-1UFA(k)] ≠ ∅ and L[CS-1UFA(2)] - ∪1≤k<∞L[CS-1DFA(k)] ≠ ∅.

Information related to the author
© 2014 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
feedback
Top