Sciweavers

423 search results - page 35 / 85
» The Generalization of Generalized Automata: Expression Autom...
Sort
View
FSTTCS
2009
Springer
14 years 3 months ago
Automata and temporal logic over arbitrary linear time
Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running sys...
Julien Cristau
WIA
2001
Springer
14 years 1 months ago
Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries
Abstract. We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We ...
Jorge Graña, Francisco-Mario Barcala, Migue...
LFCS
2007
Springer
14 years 2 months ago
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
Abstract. We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are “observer variables” whic...
Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier
ACRI
2004
Springer
14 years 2 months ago
Evolving Transition Rules for Multi Dimensional Cellular Automata
Abstract. Genetic Algorithms have been used before to evolve transition rules for one dimensional Cellular Automata (CA) to solve e.g. the majority problem and investigate communic...
Ron Breukelaar, Thomas Bäck
GECCO
2009
Springer
108views Optimization» more  GECCO 2009»
14 years 1 months ago
Development of combinational circuits using non-uniform cellular automata: initial results
A non-uniform cellular automata-based model is presented for the evolutionary development of digital circuits at the gate level. The main feature of this model is the modified lo...
Michal Bidlo, Zdenek Vasícek