33 search results - page 4 / 7 » Complexity of regular abstractions of one-counter languages |
DBPL
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...
ANLP
2000
13 years 10 months ago
2000
We compare the asymptotic time complexity of left-to-right and bidirectional parsing techniques for bilexical context-free grammars, a grammar formalis an abstraction of language ...
VL
2006
IEEE
14 years 2 months ago
2006
IEEE
To explore how people conceptualize a complex system, 232 university students were asked to sketch how a search engine works. While the sketches reveal a diverse range of visual a...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
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...
DATE
2006
IEEE
14 years 2 months ago
2006
IEEE
With the increasing complexity and heterogeneity of embedded electronic systems, a unified design methodology at evels of abstraction becomes a necessity. Meanwhile, it is also i...