48 search results - page 5 / 10 » On the Complexity of Intersecting Finite State Automata |
CONEXT
2007
ACM
13 years 11 months ago
2007
ACM
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...
WIA
2004
Springer
14 years 25 days ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
ACL
2004
13 years 9 months ago
2004
This paper describes discriminative language modeling for a large vocabulary speech recognition task. We contrast two parameter estimation methods: the perceptron algorithm, and a...
EACL
2003
ACL Anthology
13 years 9 months ago
2003
ACL Anthology
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
ICRA
2003
IEEE
14 years 23 days ago
2003
IEEE
We present an approach that uses Q-learning on individual robotic agents, for coordinating a missiontasked team of robots in a complex scenario. To reduce the size of the state sp...