101 search results - page 1 / 21 » General Algorithms for Testing the Ambiguity of Finite Autom... |
DLT
2008
13 years 7 months ago
2008
CORR
2009
Springer
13 years 3 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
COCO
2000
Springer
13 years 9 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...
NAACL
2003
13 years 6 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...
ACL
1997
13 years 6 months ago
1997
This paper presents an algorithm for the compilation of regular formalisms with rule features into finite-state automata. Rule features are incorporated into the right context of ...