48 search results - page 1 / 10 » On the Complexity of Intersecting Finite State Automata |
COCO
2000
Springer
13 years 8 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...
DLT
2007
13 years 6 months ago
2007
Abstract. We investigate the state complexity of union and intersection for finite languages. Note that the problem of obtaining the tight bounds for both operations was open. We ...
ANLP
2000
13 years 6 months ago
2000
Reduplication, a central instance of prosodic morphology, is particularly challenging for state-ofthe-art computational morphology, since it involves copying of some part of a pho...
FOSSACS
2008
Springer
13 years 6 months ago
2008
Springer
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
DLT
2008
13 years 6 months ago
2008
We prove that, for the uniform distribution over all sets X of m (that is a fixed integer) non-empty words whose sum of lengths is n, DX , one of the usual deterministic automata r...