Distributed ω-Automata
01 Aug 2003-International Journal of Foundations of Computer Science (World Scientific Publishing Company)-Vol. 14, Iss: 04, pp 681-698
TL;DR: This paper builds the theory of distributed ω-automata for finite state automata and pushdown automata in different modes of cooperation like the t-mode, *- Mode, = k- mode, ≤ k- Mode and ≥ k-mode along with different acceptance criteria, and gives proofs for the equivalence of all modes of Cooperation and acceptance criteria in the case of distributedω-pushdown automATA.
Abstract: In this paper, we introduce the notion of distributed ω-automata. Distributed ω-automata are a group of automata working in unison to accept an ω-language. We build the theory of distributed ω-automata for finite state automata and pushdown automata in different modes of cooperation like the t-mode, *-mode, = k-mode, ≤ k-mode and ≥ k-mode along with different acceptance criteria i.e. Buchi-, Muller-, Rabin- and Streett- acceptance criteria. We then analyze the acceptance power of such automata in all the above modes of cooperation and acceptance criteria. We present proofs that distributed ω-finite state automata do not have any additional power over ω-finite state automata in any of the modes of cooperation or acceptance criteria, while distributed ω-pushdown automata can accept languages not in CFLω. We give proofs for the equivalence of all modes of cooperation and acceptance criteria in the case of distributed ω-pushdown automata. We show that the power of distributed ω-pushdown automata is equal to that of ω-Turing Machines. We also study the deterministic version of distributed ω-pushdown automata. Deterministic ω-pushdown automata accept only languages contained in CFLω but distributed deterministic ω-pushdown automata can accept languages not in CFLω and have the same power as their nondeterministic counterparts. We also define distributed completely deterministic ω-pushdown automata and analyze their power.
References
More filters
Book•
19 Dec 1990
TL;DR: The Handbook of Theoretical Computer Science provides professionals and students with a comprehensive overview of the main results and developments in this rapidly evolving field.
Abstract: "Of all the books I have covered in the Forum to date, this set is the most unique and possibly the most useful to the SIGACT community, in support both of teaching and research.... The books can be used by anyone wanting simply to gain an understanding of one of these areas, or by someone desiring to be in research in a topic, or by instructors wishing to find timely information on a subject they are teaching outside their major areas of expertise." -- Rocky Ross, "SIGACT News" "This is a reference which has a place in every computer science library." -- Raymond Lauzzana, "Languages of Design" The Handbook of Theoretical Computer Science provides professionals and students with a comprehensive overview of the main results and developments in this rapidly evolving field. Volume A covers models of computation, complexity theory, data structures, and efficient computation in many recognized subdisciplines of theoretical computer science. Volume B takes up the theory of automata and rewriting systems, the foundations of modern programming languages, and logics for program specification and verification, and presents several studies on the theoretic modeling of advanced information processing. The two volumes contain thirty-seven chapters, with extensive chapter references and individual tables of contents for each chapter. There are 5,387 entry subject indexes that include notational symbols, and a list of contributors and affiliations in each volume.
3,089 citations
1,264 citations
TL;DR: Two apparently divergent areas of inquiry should give rise to the same problem, namely, that of describing the infinite history of finite automata, and it is this problem to which the remainder of this paper will address itself.
Abstract: Bfichi (1962) has given a decision procedure for a system of logic known as \" the Sequential Calculus,\" by showing that each well formed formula of the system is equivalent to a fornmla that, roughly speaking, says something about the infinite input history of a finite automaton. In so doing he managed to answer an open question that was of concern to pure logicians, some of whom had no interest in the theory of automata. Muller (1963) came upon quite similar concepts in studying a problem in asynchronous switching theory. The problem was to describe the behavior of an asynchronous circuit tha t does not reach any stability condition when starting from a certain state and subject to a certain input condition. Many different things can happen, since there is no control over how fast various parts of the circuit react with respect to each other. Since at no time during the presence of that input condition will the circuit reach a terminal condition, it will be possible to describe the total set of possibilities in an ideal fashioll only if an infinite amount of time is assumed for tha t input condition. Neither Biichi's Sequential Calculus nor ~Iuller's problem of asynchronous circuitry will be described further here. I t is interesting tha t two such apparently divergent areas of inquiry should give rise to the same problem, namely, that of describing the infinite history of finite automata. I t is this problem to which the remainder of this paper will address itself. I t will be recalled that a well known basic theorem in the theory of
553 citations
TL;DR: This paper introduces the basic notions concerning generation of ω-languages by means ofπ�-grammars and their recognition by ω -automata with various recognition modes and several decidability results are established.
106 citations
TL;DR: The paper considers multistack pushdown automata with several strategies on the use of stacks, similar to the strategies of cooperation in grammar systems, and shows that they accept a large class of nonrecursive languages.
18 citations