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
01 Jan 2000
TL;DR: One-dimensional, twodimensional and three-dimensional cellular automata are studied here and some recommendations to generalise the techniques to n-dimensional Automata are given.
Abstract: This paper presents some facts that make cellular automata parallel to L Systems. Several examples of cellular automata are considered and equivalent L Systems are constructed. A general procedure should be able to manage n-dimensional cellular automata, thus one-dimensional, twodimensional and three-dimensional cellular automata are studied here. Some recommendations to generalise the techniques to n-dimensional automata are given. The paper comments on the difficulties to develop a general procedure and the reasons to give several recommendations instead of an algorithm.
10 citations
••
TL;DR: It is shown that ASPMHFA's are equivalent to ordinary alternating multihead finite automata, and a simple, natural complexity measure is introduced, called ‘leaf-size’, which provides a spectrum of complexity classes of ASPMH FA's, based on simultaneously leaf-size, the number of heads, and the move directions of heads.
10 citations
••
TL;DR: Consequences of the model yield testable predictions about the relations between monologue, dialogue, and speech under delayed auditory feedback.
Abstract: A speaker is modeled as a probabilistic finite automaton with four internal states and input and output alphabets of 0 (silence) and 1 (sound). With identically zero input the model generates a two-state Markov chain that accounts for the on-off pattern of monologue. Two such automata, possessing the same type of decision rules, are coupled so that the output of each is input to the other. The six-state deep structure of the linked system, projected as a four-state observable sequence, can be accounted for using only three parameters per speaker. Consequences of the model yield testable predictions about the relations between monologue, dialogue, and speech under delayed auditory feedback.
10 citations
••
TL;DR: The main advantage of the minimal DFA construction algorithm is its minimal intermediate memory requirements and hence, the reduced time complexity.
Abstract: This paper describes a method for constructing a minimal deterministic finite automaton (DFA) from a regular expression. It is based on a set of graph grammar rules for combining many graphs (DFA) to obtain another desired graph (DFA). The graph grammar rules are presented in the form of a parsing algorithm that converts a regular expression R into a minimal deterministic finite automaton M such that the language accepted by DFA M is same as the language described by regular expression R. The proposed algorithm removes the dependency over the necessity of lengthy chain of conversion, that is, regular expression → NFA with e-transitions → NFA without etransitions → DFA → minimal DFA. Therefore the main advantage of our minimal DFA construction algorithm is its minimal intermediate memory requirements and hence, the reduced time complexity. The proposed algorithm converts a regular expression of size n in to its minimal equivalent DFA in O(n.log2n) time. In addition to the above, the time complexity is further shortened to O(n.logen) for n ≥ 75. General Terms Algorithms, Complexity of Algorithm, Regular Expression, Deterministic Finite Automata (DFA), Minimal DFA.
10 citations
••
20 Jun 2006TL;DR: This work uses the existing automated transformation algorithms for the various finite automata listed above, as well as one of its own, to inform a transformation from augmented regular expressions to minimized deterministic infinite automata (DFAmin).
Abstract: The equivalence of non-deterministic finite automata (NFA^1), deterministic finite automata (DFA), regular expressions (RE), and parallel finite automata (PFA) with augmented regular expressions (PRE) is used to relate parallel finite automata to the shuffle operation on regular languages. Our goal is to capitalize on the equivalence of regular expressions and augmented regular expressions to increase parallelization efficiency. We use the existing automated transformation algorithms for the various finite automata listed above, as well as one of our own, to inform a transformation from augmented regular expressions to minimized deterministic finite automata (DFAmin). We then discuss the serialization of augmented regular expressions, and present a brief summary of potential applications, related research, and future directions.
9 citations