Theoretical Computer Science
Complexity results for two-way and multi-pebble automata and their logics
ICALP '94 Selected papers from the 21st international colloquium on Automata, languages and programming
Communication complexity and parallel computing
Communication complexity and parallel computing
Handbook of formal languages, vol. 3: beyond words
Handbook of formal languages, vol. 3: beyond words
Languages, automata, and logic
Handbook of formal languages, vol. 3
Expressiveness of structured document query languages based on attribute grammars
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Information and Computation - Special issue: logic and computational complexity
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Temportal connectives versus explicit timestamps to query temporal databases
Journal of Computer and System Sciences
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Typechecking for XML transformers
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Expressive and efficient pattern languages for tree-structured data (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
On tape-bounded complexity classes and multihead finite automata
Journal of Computer and System Sciences
Two-Way Finite State Transducers with Nested Pebbles
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Logic as a Query Language: From Frege to XML
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Generalised Regular MSC Languages
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Counting Multiplicity over Infinite Alphabets
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Efficient reasoning about data trees via integer linear programming
Proceedings of the 14th International Conference on Database Theory
Variable tree automata over infinite ranked alphabets
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Logics for unranked trees: an overview
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Model checking quantified computation tree logic
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Variable automata over infinite alphabets
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Regular Expressions for Languages over Infinite Alphabets
Fundamenta Informaticae
SAS'07 Proceedings of the 14th international conference on Static Analysis
Satisfiability of a spatial logic with tree variables
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Nominal automata for resource usage control
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
On the length of knot transformations via reidemeister moves i and II
RP'12 Proceedings of the 6th international conference on Reachability Problems
Model checking systems and specifications with parameterized atomic propositions
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
| Hi-index | 0.00 |
Motivated by formal models recently proposed in the context of XML, we study automata and logics on strings over infinite alphabets. These are conservative extensions of classical automata and logics defining the regular languages on finite alphabets. Specifically, we consider register and pebble automata, and extensions of first-order logic and monadic second-order logic. For each type of automaton we consider one-way and two-way variants, as well as deterministic, non-deterministic, and alternating control. We investigate the expressiveness and complexity of the automata, their connection to the logics, as well as standard decision problems.