On the Power of Input-Synchronized Alternating Finite Automata

Authors:
Hiroaki Yamamoto
Affiliations:
-
Venue:
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Year:
2000

Citing 6
Cited 1

A note on realtime one-way synchronized alternating one-counter automata

Theoretical Computer Science
Deterministic versus nondeterministic space in terms of synchronized alternating machines

Theoretical Computer Science
Alternation

Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
On the Power of Communication in Alternating Machines

MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
On the Power of Synchronization in Parallel Computations

MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989

An Improved Algorithm for the Membership Problem for Extended Regular Expressions

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a new model of automata, called input-synchronized alternating finite automata (i-SAFAs), and study the power of i-SAFAs. We here consider two types of i-SAFAs, one-way i-SAFAs and two-way i-SAFAs. Then we show that (1) the class of languages accepted by one-way i-SAFAs is equal to the class of regular languages, (2) two-way i-SAFAs are more powerful than one-way i-SAFAs, that is, there exists a language L such that L is accepted by a two-way i-SAFA but not accepted by any one-way i-SAFAs. In addition, we show that the class of languages accepted by f(n) parallel-bounded two-way i-SAFAs is included in Nspace(S(n)), where S(n) = min{n log n, f(n) log n}.