Sciweavers

423 search results - page 8 / 85
» The Generalization of Generalized Automata: Expression Autom...
Sort
View
NAACL
2003
13 years 10 months ago
Simpler and More General Minimization for Weighted Finite-State Automata
Previous work on minimizing weighted finite-state automata (including transducers) is limited to particular types of weights. We present efficient new minimization algorithms th...
Jason Eisner
FSTTCS
2006
Springer
14 years 13 days ago
On Continuous Timed Automata with Input-Determined Guards
We consider a general class of timed automata parameterized by a set of "input-determined" operators, in a continuous time setting. We show that for any such set of opera...
Fabrice Chevalier, Deepak D'Souza, Pavithra Prabha...
CONEXT
2007
ACM
14 years 21 days ago
A hybrid finite automaton for practical deep packet inspection
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
Michela Becchi, Patrick Crowley
JUCS
2010
119views more  JUCS 2010»
13 years 7 months ago
On Succinct Representations of Textured Surfaces by Weighted Finite Automata
: Generalized finite automata with weights for states and transitions have been successfully applied to image generation for more than a decade now. Bilevel images (black and whit...
Jürgen Albert, German Tischler
ACTA
2010
104views more  ACTA 2010»
13 years 9 months ago
Reachability results for timed automata with unbounded data structures
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...