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
TL;DR: It is suggested sufficient conditions under them a CADCLA is expedient, because of distributed computation characteristic of CAs and probabilistic decision making nature of LAs.
2 citations
Proceedings Article•
01 Jan 2007
TL;DR: A solderless electrical connector comprising a printed circuit board and electrical contact terminals mounted therein, which obviates the need for solder to protect the conductive materials as well as precludes the use of solder for electrical interconnection therewith.
Abstract: Hierarchical learning automata are shown to be an excellent tool for solving multi-stage games. However, most updating schemes used by hierarchical automata expect the multi-stage game to reach an absorbing state at which point the automata are updated in a Monte Carlo way. As such, the approach is infeasible for large multi-stage games (and even for problems with an infinite horizon) and the convergence process is slow. In this paper we propose an algorithm where the rewards don't have to travel all the way up to the top of the hierarchy and in which there is no need for explicit end-stages.
2 citations
Book•
15 Aug 2001
TL;DR: This book discusses applications of Finite-State Transducers in Natural Language Processing, as well as fast Implementations of Automata Computations, and the role of Sequentialization in solving Complex Problems Efficiently with Adaptive Automata.
Abstract: Invited Lectures.- Synthesizing State-Based Object Systems from LSC Specifications.- Applications of Finite-State Transducers in Natural Language Processing.- Technical Contributions.- Fast Implementations of Automata Computations.- Regularly Extended Two-Way Nondeterministic Tree Automata.- Glushkov Construction for Multiplicities.- Implicit Structures to Implement NFA's from Regular Expressions.- New Finite Automaton Constructions Based on Canonical Derivatives.- Experiments with Automata Compression.- Computing Raster Images from Grid Picture Grammars.- A Basis for Looping Extensions to Discriminating-Reverse Parsing.- Automata for Pro-V Topologies.- Reachability and Safety in Queue Systems.- Generalizing the Discrete Timed Automaton.- Factorization of Ambiguous Finite-State Transducers.- MONA Implementation Secrets.- Cursors.- An Automaton Model of User-Controlled Navigation on the Web.- Direct Construction of Minimal Acyclic Subsequential Transducers.- Generic ?-Removal Algorithm for Weighted Automata.- An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages.- Unary Language Concatenation and Its State Complexity.- Implementation of a Strategy Improvement Algorithm for Finite-State Parity Games.- State Complexity and Jacobsthal's Function.- A Package for the Implementation of Block Codes as Finite Automata.- Regional Least-Cost Error Repair.- The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata.- Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski.- The MERLin Environment Applied to ?-NFAs.- Abstracts.- Visual Exploration of Generation Algorithms for Finite Automata on the Web.- TREEBAG.- Word Random Access Compression.- Extended Sequentialization of Transducers.- Lessons from INR in the Specification of Transductions.- Part-of-Speech Tagging with Two Sequential Transducers.- Solving Complex Problems Efficiently with Adaptive Automata.
2 citations
Dissertation•
01 Jan 2010
TL;DR: This thesis will give an introduction to the concepts of Cellular automata and higher order cellular automata, and go through several examples of both, illustrating the many possibilities with a few examples.
Abstract: This thesis will give an introduction to the concepts of cellular automata and higher order cellular automata, and go through several examples of both. Cellular automata are discrete systems of cells in an n-dimensional grid. The cells interact with each other through the use of a rule depending only on local characteristics, which lead to some global behaviour. Higher order cellular automata are hierarchical structures of cellular automata with added possibilities for dynamic local interaction. We first give an introduction for non-mathematicians. A mathematical definition of cellular automata follows, and we illustrate the many possibilities with a few examples. Higher order cellular automata are introduced and defined, and we look at the consequences higher order cellular automata has on optimization of computer implementations. Finally we apply higher order structures to some of the examples, and study the effects.
2 citations
26 Jun 1991
TL;DR: It is shown that, if theta is a Pisot number, then the normalization and the addition in basis theta are computable by a finite automaton.
Abstract: Numeration systems, the bases of which are defined by a linear recurrence with integer coefficients, are considered. Conditions on the recurrence are given under which the function of normalization which transforms any representation of an integer into the normal one-obtained by the usual algorithm-can be realized by a finite automaton. Addition is a particular case of normalization. The same questions are discussed for the representation of real numbers in basis theta , where theta is a real number >1. In particular it is shown that, if theta is a Pisot number, then the normalization and the addition in basis theta are computable by a finite automaton. >
2 citations