Topic
Continuous automaton
About: Continuous automaton is a research topic. Over the lifetime, 947 publications have been published within this topic receiving 17417 citations.
Papers published on a yearly basis
Papers
More filters
Proceedings Article•
16 Oct 2006
TL;DR: The aim is to design an automaton that can determine the best action guided by past actions and responses, and the reinforcement scheme presented is shown to satisfy all necessary and sufficient conditions for absolute expediency for a stationary environment.
Abstract: A stochastic automaton can perform a finite number of actions in a random environment. When a specific action is performed, the environment responds by producing an environment output that is stochastically related to the action. This response may be favorable or unfavorable. The aim is to design an automaton that can determine the best action guided by past actions and responses. The reinforcement scheme presented is shown to satisfy all necessary and sufficient conditions for absolute expediency for a stationary environment. An automaton using this scheme is guaranteed to "do better" at every time step than at the previous step (expected value of the average penalty at one iteration step is less than of the previous step for all steps). Some simulation results are presented, which prove that our algorithm converges to a solution faster than the one given in [7].
2 citations
TL;DR: A practical technique to compile pattern-matching of prioritised overlapping patterns in equational languages to an minimal deterministic left-to-right matching automaton using an efficient method to identify subautomata and avoid their construction while generating the dag automaton.
Abstract: We propose a practical technique to compile pattern-matching of prioritised overlapping patterns in equational languages to an minimal deterministic left-to-right matching automaton. First, we present a method to construct a tree matching automaton for such patterns. The automaton obtained allows pattern-matching to be performed without any backtracking. Although this automaton is efficient since it avoids symbol re-examination, it can only achieve this at the cost of increased space requirements. Such space requirements could be minimised by using a dag automaton that shares all the isomorphic subautomata which are duplicated in a tree automaton. We design an efficient method to identify such subautomata and avoid their construction while generating the dag automaton. This is achieved without constructing the tree automaton first.
2 citations
TL;DR: A finite state probabilistic automaton existed that would accept a context sensitive language that is not context free and this automaton is constructed.
Abstract: It is known that nonregular languages can be accepted by finite state probabilistic automata. For many years it was not known whether a finite state probabilistic automaton existed that would accept a context sensitive language that is not context free. Such a finite state probabilistic automaton is constructed.
2 citations
01 Jan 2008
2 citations
TL;DR: This paper shows that failure-based equivalences CFFD and NDFD are congruences with respect to composition of constraint automata using their join (production) and hiding operators and can be used for reducing sizes of models before doing model checking based verification.
2 citations