426 search results - page 29 / 86 » Synchronization of Regular Automata |
IDEAS
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper we study the problem of deciding whether a regular path query over views in data-integration systems can be re-expressed without recursion. The problem becomes chall...
ICDT
2012
ACM
11 years 10 months ago
2012
ACM
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We consider policies that are described by regular expressions, finite automata, or formulae of linear temporal logic (LTL). Such policies are assumed to describe situat...
FMSD
2007
13 years 7 months ago
2007
In the classical framework of formal languages, a refinement n is modeled by a substitution and an abstraction by an inverse substitution. These mechanisms have been widely studie...
LICS
2010
IEEE
13 years 6 months ago
2010
IEEE
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...