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 published on a yearly basis
Papers
More filters
••
08 Nov 2004
TL;DR: It is proven that an interface automaton refines another if and only if there exists a special kind of forward simulation between their corresponding I/O automata, which shows the essential relation between interface automata and I/o automata on refinements.
Abstract: Interface automata is a formal model to be used for describing the temporal interface behaviors of software components. It adopts an alternating approach to design refinement, which is significantly different with the traditional use of automata. In this paper, it is proven that an interface automaton refines another if and only if there exists a special kind of forward simulation between their corresponding I/O automata, which shows the essential relation between interface automata and I/O automata on refinements.
9 citations
••
TL;DR: The potential use of cellular automata machines for electromagnetic field solution is investigated and lattice gas automata which use simple variables to describe particles that interact with nearest neighbours on the lattice through simple rules are examined.
Abstract: In this paper, the potential use of cellular automata machines for electromagnetic field solution is investigated. Cellular automata are computational models that operate on a discrete spatial lattice, evolve in discrete time, and employ simple discrete variables. We specifically examine the lattice gas automata which use simple variables to describe particles that interact with nearest neighbours on the lattice through simple rules. They are suitable for modelling the linear wave equation in two dimensions. A benefit of the cellular automata approach is that low-cost, special-purpose digital hardware exists for their efficient evaluation. The current state-of-the-art cellular automata machine is CAM-8. Computational experiments carried out on CAM-8 are provided for problems involving plane wave interaction with perfectly conducting and dielectric media in two dimensions. The examples indicate the potential use of lattice gas automata for modelling electromagnetics and their efficient evaluation using cellular automata machines.
9 citations
••
13 Sep 2010TL;DR: It is proved in this work that, under certain conditions, an algorithm that arbitrarily merges states in the prefix tree acceptor of the sample in a consistent way, converges to the minimum DFA for the target language in the limit.
Abstract: We prove in this work that, under certain conditions, an algorithm that arbitrarily merges states in the prefix tree acceptor of the sample in a consistent way, converges to the minimum DFA for the target language in the limit. This fact is used to learn automata teams, which use the different automata output by this algorithm to classify the test. Experimental results show that the use of automata teams improve the best known results for this type of algorithms. We also prove that the well known Blue-Fringe EDSM algorithm, which represents the state of art in merging states algorithms, suffices a polynomial characteristic set to converge.
9 citations
••
07 Jun 1992TL;DR: A novel network model and a learning algorithm based on symbol processing theory are described that can learn the subgrammar, which is the important feature for distinguishing context-free grammars and finite state automata.
Abstract: A novel network model and a learning algorithm based on symbol processing theory are described. The algorithm is derived from the minimization method of finite automata under the correspondence between Elman networks and finite automata. An attempt was made to learn context-free grammars by the new model network. Even though this learning method was derived under the correspondence to finite automata, the network can learn the subgrammar, which is the important feature for distinguishing context-free grammars and finite state automata. >
9 citations
••
18 Oct 1967
TL;DR: The structure connections between the endomorphisms, automorphisms, and all congruence relations of an arbitrary, not necessarily finite or strongly connected automaton are investigated.
Abstract: The structure connections between the endomorphisms, automorphisms, and all congruence relations of an arbitrary, not necessarily finite or strongly connected automaton are investigated It is shown how the symmetries of an automaton carry over to symmetries of the lattice of congruence relations and to symmetries of quotient automata A Galois connection is established between the endomorphisms and the congruence relations of an automaton
9 citations