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
Journal ArticleDOI
TL;DR: This paper demonstrates the equivalence between a reversible automaton where the ancestors only differ at one side (technically with one of the two Welch indices equal to 1) and a full shift and proves that there is always a way of transforming a de Bruijn diagram into the full shift.
Abstract: Reversible cellular automata are invertible discrete dynamical systems which have been widely studied both for analysing interesting theoretical questions and for obtaining relevant practical applications, for instance, simulating invertible natural systems or implementing data coding devices. An important problem in the theory of reversible automata is to know how the local behaviour which is not invertible is able to yield a reversible global one. In this sense, symbolic dynamics plays an important role for obtaining an adequate representation of a reversible cellular automaton. In this paper we prove the equivalence between a reversible automaton where the ancestors only differ at one side (technically with one of the two Welch indices equal to 1) and a full shift. We represent any reversible automaton by a de Bruijn diagram, and we characterize the way in which the diagram produces an evolution formed by undefined repetitions of two states. By means of amalgamations, we prove that there is always a way of transforming a de Bruijn diagram into the full shift. Finally, we provide an example illustrating the previous results.

1 citations

Journal Article
TL;DR: This paper presents a suitable formalism for the Broadcast Automata System, a model of massively parallel computation, introduced by the authors for prototyping of scientific applications, based on an extension of the classical formalist for finite state automata.
Abstract: This paper presents a suitable formalism for the Broadcast Automata System, a model of massively parallel computation, introduced by the authors for prototyping of scientific applications. The model consists of a collection of identical entities, modelled as finite state automata, a global synchroniser providing coordination between the automata and a broadcast communication system, to which each automaton is connected, granting information exchange among the automata. The formalism is based on an extension of the classical formalism for finite state automata. The application to a case study concerning the recognition of first order propositional formulae is illustrated and the correctness proof is sketched.

1 citations

08 Apr 2009
TL;DR: Using the benefits of functions of lazy evaluations in Haskell, this work can express a language set which contains infinite elements as concrete functional notations like mathematical notations as well as define finite automata and linear grammars and construct sticker systems which have the same power of finite automaton and linear Grammars.
Abstract: We realized operations appeared in the theory of automata using Haskell languages. Using the benefits of functions of lazy evaluations in Haskell, we can express a language set which contains infinite elements as concrete functional notations like mathematical notations. Our modules can be used not only for analyzing the properties about automata and their application systems but also for self study materials or a tutorial to learn automata, grammar and language theories. We also implemented the modules for sticker systems. Paun and Rozenberg explained a concrete method to transform an automaton to a sticker system in 1998. We modified their definitions and improved their insufficient results. Using our module functions, we can easily define finite automata and linear grammars and construct sticker systems which have the same power of finite automata and linear grammars.

1 citations

Posted Content
20 Jan 2011
TL;DR: It is shown that quantum finite automata can be polynomially more succinct than their classical counterparts for promise problems in case of exact computation and in terms of language recognition the same result is shown to be valid up to a constant factor depending on how bigger the size of the alphabet is.
Abstract: In this note, we show that quantum finite automata can be polynomially more succinct than their classical counterparts for promise problems in case of exact computation. Additionally, in terms of language recognition, the same result is shown to be valid up to a constant factor depending on how bigger the size of the alphabet is.

1 citations

Book ChapterDOI
01 Aug 2015
TL;DR: An approach to frame semantics is built on a conception of frames as finite automata, observed through the strings they accept, where an institution in the sense of Goguen and Burstall is formed where these strings can be refined or coarsened to picture processes at various bounded granularities.
Abstract: An approach to frame semantics is built on a conception of frames as finite automata, observed through the strings they accept. An institution in the sense of Goguen and Burstall is formed where these strings can be refined or coarsened to picture processes at various bounded granularities, with transitions given by Brzozowski derivatives.

1 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