116 search results - page 8 / 24 » Minimization of Automata |
COLING
2000
14 years 10 months ago
2000
COLING
2002
14 years 10 months ago
2002
LATIN
2010
Springer
15 years 1 days ago
2010
Springer
We study the worst case complexity of regular operations on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the result...
CLIN
2003
14 years 11 months ago
2003
This paper presents an efficient algorithm for the incremental construction of a minimal acyclic sequential transducer (ST) from a list of input and output strings. The algorithm...
HYBRID
1998
Springer
15 years 2 months ago
1998
Springer
We continue investigation of languages, accepted by timed automata of Alur and Dill. In [ACM97] timed regular expressions equivalent to timed automata were introduced. Here we intr...