144 search results - page 1 / 29 » How Expressions Can Code for Automata |
LATIN
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we investigate how it is possible to recover an automaton from a rational expression that has been computed from that automaton. The notion of derived term of an expr...
POPL
2000
ACM
13 years 9 months ago
2000
ACM
Certified code is a general mechanism for enforcing security properties. In this paradigm, untrusted mobile code carries annotations that allow a host to verify its trustworthine...
LPAR
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
CC
2005
Springer
13 years 6 months ago
2005
Springer
Various techniques for the navigation and matching of data structures using path expressions have been the subject of extensive investigations. No matter whether such techniques ar...