Sciweavers

2465 search results - page 24 / 493
» Automata on Linear Orderings
Sort
View
COCOON
2001
Springer
14 years 6 days ago
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look...
Zhe Dang, Oscar H. Ibarra, Richard A. Kemmerer
LATA
2009
Springer
14 years 2 months ago
On the Average Size of Glushkov's Automata
Abstract. Glushkov’s algorithm builds an ε-free nondeterministic automaton from a given regular expression. In the worst case, its number of states is linear and its number of t...
Cyril Nicaud
ENTCS
2007
117views more  ENTCS 2007»
13 years 7 months ago
Relating Hybrid Chi to Other Formalisms
The hybrid χ (Chi) formalism is suited to modeling, simulation and verification of hybrid systems. It integrates concepts from dynamics and control theory with concepts from com...
D. A. van Beek, J. E. Rooda, Ramon R. H. Schiffele...
ADBIS
2009
Springer
108views Database» more  ADBIS 2009»
14 years 2 months ago
Linear Systems for Regular Hedge Languages
We propose linear systems of hedge language equations (LSH) as a formalism to represent regular hedge languages. These linear systems are suitable for several computations in the a...
Mircea Marin, Temur Kutsia
ALT
2006
Springer
14 years 4 months ago
Learning Linearly Separable Languages
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri