Sciweavers

164 search results - page 18 / 33
» Quotient Complexity of Regular Languages
Sort
View
ICALP
2009
Springer
14 years 9 months ago
High Complexity Tilings with Sparse Errors
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...
Bruno Durand, Andrei E. Romashchenko, Alexander Sh...
IJWGS
2006
125views more  IJWGS 2006»
13 years 9 months ago
Compiling business processes: untangling unstructured loops in irreducible flow graphs
: This paper presents a systematic study of some major problems involved in the transformation of business process modelling languages to executable business process representation...
Wei Zhao, Rainer Hauser, Kamal Bhattacharya, Barre...
ACL
1998
13 years 10 months ago
A Descriptive Characterization of Tree-Adjoining Languages (Project Note)
Since the early Sixties and Seventies it has been known that the regular and context-free languages arc characterized by definability in the monadic second-order theory of certain...
James Rogers
SAC
2008
ACM
13 years 8 months ago
Aggregation languages for moving object and places of interest
We address aggregate queries over GIS data and moving object data, where non-spatial information is stored in a data warehouse. We propose a formal data model and query language t...
Leticia I. Gómez, Bart Kuijpers, Alejandro ...
FOSSACS
2009
Springer
14 years 1 months ago
On Omega-Languages Defined by Mean-Payoff Conditions
In quantitative verification, system states/transitions have associated costs, and these are used to associate mean-payoff costs with infinite behaviors. In this paper, we propose ...
Rajeev Alur, Aldric Degorre, Oded Maler, Gera Weis...