124 search results - page 4 / 25 » Antichain Algorithms for Finite Automata |
COCO
2000
Springer
13 years 11 months ago
2000
Springer
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
STOC
1993
ACM
13 years 11 months ago
1993
ACM
SPIRE
2005
Springer
14 years 24 days ago
2005
Springer
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
ICALP
2010
Springer
14 years 3 days ago
2010
Springer
Abstract. This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Empti...
NAACL
2003
13 years 8 months ago
2003
Previous work on minimizing weighted finite-state automata (including transducers) is limited to particular types of weights. We present efficient new minimization algorithms th...