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 1969
TL;DR: Automata coding is the least developed, although highly important, step in synthesis, determining reliability, stability, memory size, and complexity of the logical transformer (LT) [1].
Abstract: The task of coding a finite automation consists in putting into correspondence with each input, output, and internal state a definite set of values of the basic input, output, and supplementary input signals respectively of the combinatory scheme (logical transformer). Automata coding is the least developed, although highly important, step in synthesis, determining reliability, stability, memory size, and complexity of the logical transformer (LT) [1].
TL;DR: It is stated that all the non-trivial properties of the regular (or @w-regular) languages, are PSPACE-hard on CFAs with @e-moves and onCFAs without @e -moves accepting infinite words.
Abstract: We present a general result, similar to Rice's theorem, concerning the complexity of detecting properties on finite automata enriched by bounded cooperative concurrency, such as statecharts and abstract parallel automata, which we denote by CFAs (Concurrent Finite Automata). On one extreme, the complexity of detecting non-trivial properties that preserve equivalence of machines, i.e. properties of the accepted language, on finite automata, can be as little as O(1). On the other extreme, Rice's theorem states that all such properties on Turing machines are undecidable. We state that all the non-trivial properties of the regular (or @w-regular) languages, are PSPACE-hard on CFAs with @e-moves and on CFAs without @e-moves accepting infinite words. We also extend this result to CFAs without @e-moves accepting finite words that satisfy a condition that holds for many properties.
TL;DR: Tape sets and a tape set product are defined, and relationships are found between a table of products of tape sets and elements in the operation-preserving group of a finite automaton.
Abstract: Tape sets and a tape set product are defined, and relationships are found between a table of products of tape sets and elements in the operation-preserving group of a finite automaton.
01 Sep 2015
TL;DR: This paper shows that instead of a general fuzzy automaton, one can deal equivalently with a chain of non-deterministic automata and further investigates some specific relationship between the output L-valued subsets of generalized L-GFAs and the outputs of NDAs.
Abstract: In this paper, we consider the general fuzzy automata based on complete residuated lattice-valued (L-GFAs). We mainly discuss the relationship between the category of L-GFAs and the category of non-deterministic automata (NDAs). Specially, we show that instead of a general fuzzy automaton we can deal equivalently with a chain of non-deterministic automata. Also, we further investigate some specific relationship between the output L-valued subsets of generalized L-GFAs and the output L-valued subsets of NDAs.
TL;DR: An automata model with improved learning schemes is proposed to solve the global optimization problem and it is proved that the automaton converges to the global optimum with a probability arbitrarily close to 1.
Abstract: In this paper, we consider the multi‐modal function optimization problem. An automata model with improved learning schemes is proposed to solve the global optimization problem. Theoretically, we prove that the automaton converges to the global optimum with a probability arbitrarily close to 1. The numerical simulation results show that the automata approach is better than both the well‐known gradient approach and the simulated annealing method. The simulation results also show that our automata model converges faster than the other existing models in the literature.