scispace - formally typeset
Search or ask a question
Topic

ω-automaton

About: ω-automaton is a research topic. Over the lifetime, 2299 publications have been published within this topic receiving 68468 citations. The topic is also known as: stream automaton & ω-automata.


Papers
More filters
Proceedings ArticleDOI
Dines Bjørner1
17 Nov 1970
TL;DR: This paper uses essentially the line control procedures which these documents set out to define to arrive at a complete, precise and unambiguous definition of finite state automata.
Abstract: The notions of finite state automata, state transition graphs and tables and the set of regular languages being accepted (generated) by such automata are well known. But for some reason these notions have not been rigorously applied in the definition of data communication line control procedures. It is the objective of this paper to do so and to show the naturalness of this approach. We claim that we thereby arrive at a complete, precise and unambiguous definition. Others have attempted this before us. They have, however, not used the descriptional tool of finite state automata. Any one or all of these references thus form the basis on which we will compete and we shall use essentially the line control procedures which these documents set out to define.

14 citations

Journal ArticleDOI
TL;DR: A formal definition of an elementary programming language for a stack automaton is given, and it is shown how this may be readily adapted to other classes of automata.
Abstract: The techniques of automatic programming are useful for constructive proofs in automata theory. A formal definition of an elementary programming language for a stack automaton is given, and it is shown how this may be readily adapted to other classes of automata. The second part of this paper shows how this programming language can be applied to automata theory, as we prove there are non-context-sensitive languages accepted by a stack automaton.

14 citations

Journal ArticleDOI
01 Nov 2009
TL;DR: It is shown that nondeterminism is better than determinism, that is, for all three modes of shifting there is a language accepted by the nondeterministic model but not accepted by any deterministic automaton of the same type.
Abstract: We introduce and investigate input-revolving finite automata, which are (nondeterministic) finite state automata with the additional ability to shift the remaining part of the input. Three different modes of shifting are considered, namely revolving to the left, revolving to the right, and circular interchanging. We investigate the computational capacities of these three types of automata and their deterministic variants, comparing any of the six classes of automata with each other and with further classes of well-known automata. In particular, it is shown that nondeterminism is better than determinism, that is, for all three modes of shifting there is a language accepted by the nondeterministic model but not accepted by any deterministic automaton of the same type. Concerning the closure properties most of the deterministic language families studied are not closed under standard operations. For example, we show that the family of languages accepted by deterministic right-revolving finite automata is an anti-AFL which is not closed under reversal and intersection.

14 citations

Book ChapterDOI
01 Jan 2007
TL;DR: This chapter describes a systematic exposition of automata theory, and defines the classes of languages accepted—namely, orthomodular lattice-valued regular languages and context-free languages.
Abstract: Publisher Summary It is noted that a theory of computation based on quantum logic is to be established as a logical foundation of quantum computation. Finite automata and pushdown automata are considered the simplest abstract mathematical models of computing machines. Automata theory is an essential part of computation theory. This chapter describes a systematic exposition of automata theory. In context to this theory, quantum logic is treated as an orthomodular lattice-valued logic. The approach employed in developing this theory is essentially the semantical analysis. This chapter introduces notions of orthomodular lattice-valued finite automata and pushdown automata and their various variants. It defines the classes of languages accepted—namely, orthomodular lattice-valued regular languages and context-free languages. This chapter also re-examines various properties of automata in the framework of quantum logic, including the Kleene theorem concerning equivalence between finite automata and regular expressions, equivalence between pushdown automata and context-free grammars, and the pumping lemma both for regular languages and for context-free languages.

14 citations

Journal ArticleDOI
TL;DR: In this article, an operational model of concurrent systems, called automata with concurrency relations, was investigated, where the event set is endowed with a collection of binary relations which indicate when two events, in a particular state of the automaton, commute.

14 citations


Network Information
Related Topics (5)
Time complexity
36K papers, 879.5K citations
88% related
Data structure
28.1K papers, 608.6K citations
83% related
Model checking
16.9K papers, 451.6K citations
83% related
Approximation algorithm
23.9K papers, 654.3K citations
82% related
Petri net
25K papers, 406.9K citations
82% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20238
202219
20201
20191
20185
201748