Sciweavers

762 search results - page 46 / 153
» Intercode Regular Languages
Sort
View
FCT
2009
Springer
15 years 6 months ago
Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies
Given a set P of natural numbers, we consider infinite games where the winning condition is a regular -language parametrized by P. In this context, an -word, representing a play, h...
Paul Hänsch, Michaela Slaats, Wolfgang Thomas
NJC
2006
102views more  NJC 2006»
15 years 2 months ago
Online Evaluation of Regular Tree Queries
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Alexandru Berlea
PAAMS
2010
Springer
15 years 7 days ago
A Case Study on Grammatical-Based Representation for Regular Expression Evolution
Abstract. Regular expressions, or simply regex, have been widely used as a powerful pattern matching and text extractor tool through decades. Although they provide a powerful and f...
Antonio González-Pardo, David F. Barrero, D...
CONCUR
2009
Springer
15 years 5 days ago
On Convergence of Concurrent Systems under Regular Interactions
Convergence is often the key liveness property for distributed systems that interact with physical processes. Techniques for proving convergence (asymptotic stability) have been ex...
Pavithra Prabhakar, Sayan Mitra, Mahesh Viswanatha...
FMCAD
2008
Springer
15 years 3 months ago
Augmenting a Regular Expression-Based Temporal Logic with Local Variables
The semantics of temporal logic is usually defined with respect to a word representing a computation path over a set of atomic propositions. A temporal logic formula does not contr...
Cindy Eisner, Dana Fisman