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
23 Aug 2005
TL;DR: A DNA finite automaton with three internal states is described and a scheme of DNA automaton model in which the tape head can move forward and backward, and symbols can be read from and write into the tape is proposed to extend the computation ability ofDNA automaton and its application fields.
Abstract: DNA automaton is a simple molecular-scale automaton, in which the converting of information deploys in molecule-scale by DNA and DNA-manipulating enzymes autonomously Finite automaton with two internal states has been applied to medical diagnosis This paper analyses the computation ability of DNA automaton with different enzymes and the possibility of DNA finite automaton with three internal states which is more powerful than the two internal states finite automaton Finally, we describe a DNA finite automaton with three internal states and proposal a scheme of DNA automaton model in which the tape head can move forward and backward, and symbols can be read from and write into the tape, thus extend the computation ability of DNA automaton and its application fields
13 citations
TL;DR: A new bounded model checking encoding using alternating automata is given and the relationship between alternating automATA and SNF is focused on and the differences in the way SNF, alternating, and Buchi automata are used from both a theoretical and an experimental perspective are explored.
13 citations
TL;DR: A bicategory whose objects are natural numbers, in which an arrow M: n→p is a finite state automaton with n input states, p output states, and some additional internal states is described, which gives a compositional semantics to a primitive notion of concurrent processes.
Abstract: Sabadini, Walters and others have developed a categorical, machine based theory of concurrency in which there are four essential aspects: a distributive category of data-types; a bicategory Mach whose objects are data types, and whose arrows are input-output machines built from data types; a semantic category (or categories) Sem, suitable to contain the behaviors of machines, and a functor, “behavior”: Mach→Sem. Suitable operations on machines and semantics are found so that the behavior functor preserves these operations. Then, if each machine is decomposable into primitive machines using these operations, the behavior of a general machine is deducible from the behavior of its parts. The theory of non-deterministic finite state automata provides an example of the paradigm and also throws some light on the classical theory of finite state automata. We describe a bicategory whose objects are natural numbers, in which an arrow M: n→p is a finite state automaton with n input states, p output states, and some additional internal states; we require that no transitions begin at output states or end at input states. A machine is represented by an q+n by q+p matrix. The bicategory supports additional operations: non-deterministic choice, parallel interleaving, and feedback. Enough operations are imposed on machines to show that each machine may be obtained from some atomic ones by means of the operations. The semantic category is the (Bloom-Esik) iteration theory Mat
(X✶ whose objects are natural numbers and whose arrows from n to p are n×p matrices with entries in the semiring of languages. The behavior functor associates to a machine M: n→p a matrix |M| of languages, one language to each pair of input and output states. Behavior preserves composition, feedback, takes non-deterministic choice to union, and parallel-interleaving to shuffle. Thus, behavior gives a compositional semantics to a primitive notion of concurrent processes.
13 citations
TL;DR: It is shown that it is not always possible to get a 90 150 cellular automata whose transition matrix has characteristic polynomial p(x), and it is used to enumerate the number of reversible strings of a fixed length.
13 citations
Journal Article•
TL;DR: In this article, it was shown that the set of images encodable as finite automata is closed under rational affine transformations, which is the case for all images with rational corner points.
Abstract: Finite automata are used for the encoding and compression of images. For black-and-white images, for instance, using the quad-tree representation, the black points correspond to w-words defining the corresponding paths in the tree that lead to them. If the w-language consisting of the set of all these words is accepted by a deterministic finite automaton then the image is said to be encodable as a finite automaton. For grey-level images and colour images similar representations by automata are in use. In this paper we address the question of which images can be encoded as finite automata with full infinite precision. In applications, of course, the image would be given and rendered at some finite resolution - this amounts to considering a set of finite prefixes of the w-language - and the features in the image would be approximations of the features in the infinite precision rendering. We focus on the case of black-and-white images - geometrical figures, to be precise - but treat this case in a d-dimensional setting, where d is any positive integer. We show that among all polygons in d-dimensional space those with rational corner points are encodable as finite automata. In the course of proving this we show that the set of images encodable as finite automata is closed under rational affine transformations. Several simple properties of images encodable as finite automata are consequences of this result. Finally we show that many simple geometric figures such as circles and parabolas are not encodable as finite automata.
13 citations