Finite-state unification automata and relational languages
Information and Computation
Theoretical Computer Science
Intractability of decision problems for finite-memory automata
Theoretical Computer Science - Special issue on universal machines and computations
XPath Containment in the Presence of Disjunction, DTDs, and Variables
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Automates a pile sur des alphabets infinis
STACS '84 Proceedings of the Symposium of Theoretical Aspects of Computer Science
Automatic verification of recursive procedures with one integer parameter
Theoretical Computer Science - Mathematical foundations of computer science
First-order logic with two variables and unary temporal logic
Information and Computation - Special issue: LICS'97
An algebraic approach to data languages and timed languages
Information and Computation
Decidability of reachability in vector addition systems (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
XML with data values: typechecking revisited
Journal of Computer and System Sciences - Special issu on PODS 2001
An algebraic characterization of deterministic regular languages over infinite alphabets
Theoretical Computer Science
Information Systems
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
XPath satisfiability in the presence of DTDs
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the Freeze Quantifier in Constraint LTL: Decidability and Complexity
TIME '05 Proceedings of the 12th International Symposium on Temporal Representation and Reasoning
Two-variable logic on data trees and XML reasoning
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Two-Variable Logic on Words with Data
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
LTL with the Freeze Quantifier and Register Automata
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Regular Expressions for Languages over Infinite Alphabets
Fundamenta Informaticae
Satisfiability of XPath queries with sibling axes
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
First order paths in ordered trees
ICDT'05 Proceedings of the 10th international conference on Database Theory
A Decidable Temporal Logic of Repeating Values
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
LTL with the freeze quantifier and register automata
ACM Transactions on Computational Logic (TOCL)
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML with incomplete information: models, properties, and query answering
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Counting Multiplicity over Infinite Alphabets
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
On notions of regularity for data languages
Theoretical Computer Science
Model checking memoryful linear-time logics over one-counter automata
Theoretical Computer Science
Model checking freeze LTL over one-counter automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
On pebble automata for data languages with decidable emptiness problem
Journal of Computer and System Sciences
XML with incomplete information
Journal of the ACM (JACM)
Safety alternating automata on data words
ACM Transactions on Computational Logic (TOCL)
Automata vs. logics on data words
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Two-variable logic with two order relations
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Alternating automata on data trees and XPath satisfiability
ACM Transactions on Computational Logic (TOCL)
Two-variable logic and key constraints on data words
Proceedings of the 14th International Conference on Database Theory
Efficient evaluation for a temporal logic on changing XML documents
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An automaton over data words that captures EMSO logic
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
A succinct canonical register automaton model
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Symbolic finite state transducers: algorithms and applications
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Foundations of XML based on logic and automata: a snapshot
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Regular expressions for data words
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
On nominal regular languages with binders
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Highly expressive query languages for unordered data trees
Proceedings of the 15th International Conference on Database Theory
Regular path queries on graphs with data
Proceedings of the 15th International Conference on Database Theory
Finite automata over structures
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Toward model theory with data values
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
On notions of regularity for data languages
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Shuffle expressions and words with nested data
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Nominal automata for resource usage control
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
A succinct canonical register automaton model for data domains with binary relations
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
A characterisation of languages on infinite alphabets with nominal regular expressions
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Runtime verification based on register automata
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Graph Reachability and Pebble Automata over Infinite Alphabets
ACM Transactions on Computational Logic (TOCL)
Applications of symbolic finite automata
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Towards nominal context-free model-checking
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Equivalence of extended symbolic finite transducers
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Reasoning about Data Repetitions with Counter Systems
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of semistructured data, timed automata and extended temporal logics. This paper survey several know results on automata and logics manipulating data words and data trees, the focus being on their relative expressive power and decidability.