Sciweavers

81 search results - page 5 / 17
» Closure of Language Classes Under Bounded Duplication
Sort
View
ICALP
2000
Springer
13 years 11 months ago
On the Power of Tree-Walking Automata
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
Frank Neven, Thomas Schwentick
ICALP
2005
Springer
14 years 1 months ago
Preservation Under Extensions on Well-Behaved Finite Structures
A class of relational structures is said to have the extension preservation property if every first-order sentence that is preserved under extensions on the class is equivalent t...
Albert Atserias, Anuj Dawar, Martin Grohe
COCO
2003
Springer
85views Algorithms» more  COCO 2003»
14 years 22 days ago
Universal Languages and the Power of Diagonalization
We define and study strong diagonalization and compare it to weak diagonalization, implicit in [7]. Kozen’s result in [7] shows that virtually every separation can be recast as...
Alan Nash, Russell Impagliazzo, Jeffrey B. Remmel
LATIN
2010
Springer
14 years 2 months ago
The Language Theory of Bounded Context-Switching
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
LATA
2009
Springer
14 years 2 months ago
On Extended Regular Expressions
d abstract) Benjamin Carle, Paliath Narendran and Colin Scheriff Dept. of Computer Science University at Albany–SUNY Albany, NY 12222 June 19, 2007 In this paper we extend the ...
Benjamin Carle, Paliath Narendran