644 search results - page 14 / 129 » Precedence Automata and Languages |
LATIN
2010
Springer
13 years 9 months 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...
ICALP
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...
ICALP
1999
Springer
13 years 11 months ago
1999
Springer
ICALP
1994
Springer
13 years 11 months ago
1994
Springer
FP
1992
13 years 11 months ago
1992