116 search results - page 16 / 24 » Minimization of Automata |
109
click to vote
CONCUR
2006
Springer
15 years 1 days ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Büchi, regular languages have been classified according ...
107
click to vote
ICS
2010
Tsinghua U.
15 years 7 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
105
click to vote
ISSRE
2010
IEEE
14 years 8 months ago
2010
IEEE
— With the increasing reliance of complex real-world applications on composite web services assembled from independently developed component services, there is a growing need for...
DBPL
2005
Springer
15 years 3 months ago
2005
Springer
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML. The flexibility of these mechanisms demands novel approaches ...