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
••
12 Sep 1995TL;DR: This work outlines a possibility to associate with parallel computations on a semilattice a finite automaton defined on semilATTices which models the computations, and studies three problems concerning the design of finite automata onSemilattices.
Abstract: First, we outline a possibility to associate with parallel computations on a semilattice a finite automaton defined on semilattices which models the computations, and then we study three problems concerning the design of finite automata on semilattices — synthesis, minimization, and decomposition.
1 citations
•
TL;DR: This paper deals with verification of safety properties of term-rewriting systems by finding a finite countermodel for a first-order formula by means of a generic finite model finding procedure.
Abstract: In this paper we deal with verification of safety properties of term-rewriting systems. The verification problem is translated to a purely logical problem of finding a finite countermodel for a first-order formula, which further resolved by a generic finite model finding procedure. A finite countermodel produced during successful verification provides with a concise description of the system invariant sufficient to demonstrate a specific safety property.
We show the relative completeness of this approach with respect to the tree automata completion technique. On a set of examples taken from the literature we demonstrate the efficiency of finite model finding approach as well as its explanatory power.
1 citations
••
20 Dec 2014TL;DR: Four-dimensional probabilistic finite automata are introduced, and some accepting powers of them are investigated, to explicate the properties of four-dimensional automata.
Abstract: This paper is a study of four-dimensional automata. Recently, due to the advances in many application areas such as dynamic image processing, computer animation, augmented reality (AR), and so on, it is useful for analyzing computation of four-dimensional information processing (three-dimensional pattern processing with time axis) to explicate the properties of four-dimensional automata. From this point of view, we have investigated many properties of four-dimensional automata and computational complexity. On the other hand, the class of sets accepted by probabilistic machines have been studied extensively. As far as we know, however, there is no results concerned with four-dimensional probabilistic machines. In this paper, we introduce four-dimensional probabilistic finite automata, and investigate some accepting powers of them.
1 citations
01 May 2015
TL;DR: In this article, the authors introduced a notion of periodic one-dimensional cellular automata and presented the simulation for some fractal type periodic cellular automaton with period-3 entropy.
Abstract: Cellular automata are a new approach that has been rapidly used in many area of science In this paper, we introduce a notion of periodic one-dimensional cellular automata In addition, we calculate entropy of some periodic cellular automata of period-3 and present the simulation for some fractal type periodic cellular automata
1 citations