Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Theoretical Computer Science
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
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
Languages, automata, and logic
Handbook of formal languages, vol. 3
Information and Computation - Special issue: logic and computational complexity
Temportal connectives versus explicit timestamps to query temporal databases
Journal of Computer and System Sciences
Journal of the ACM (JACM)
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Intractability of decision problems for finite-memory automata
Theoretical Computer Science - Special issue on universal machines and computations
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
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
A Web Odyssey: from Codd to XML
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML with data values: typechecking revisited
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the power of walking for querying tree-structured data
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Query automata over finite trees
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
A formal model for an expressive fragment of XSLT
Information Systems - Databases: Creation, management and utilization
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Two-variable logic on data trees and XML reasoning
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the freeze quantifier in Constraint LTL: Decidability and complexity
Information and Computation
Journal of Computer and System Sciences
Regular Expressions for Languages over Infinite Alphabets
Fundamenta Informaticae
Static analysis of XML processing with data values
ACM SIGMOD Record
Static analysis of active XML systems
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
LTL with the freeze quantifier and register automata
ACM Transactions on Computational Logic (TOCL)
Automatic verification of database-driven systems: a new frontier
Proceedings of the 12th International Conference on Database Theory
Automatic verification of data-centric business processes
Proceedings of the 12th International Conference on Database Theory
Two-variable logic on data trees and XML reasoning
Journal of the ACM (JACM)
Security-By-Contract for the Future Internet
Future Internet --- FIS 2008
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata
Languages: From Formal to Natural
Counting Multiplicity over Infinite Alphabets
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Static analysis of active XML systems
ACM Transactions on Database Systems (TODS)
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
A Note on Two-pebble Automata Over Infinite Alphabets
Fundamenta Informaticae - Bridging Logic and Computer Science: to Johann A. Makowsky for his 60th birthday
Tree automata over infinite alphabets
Pillars of computer science
Algorithmic analysis of array-accessing programs
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
On pebble automata for data languages with decidable emptiness problem
Journal of Computer and System Sciences
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
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Streaming transducers for algorithmic verification of single-pass list-processing programs
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the satisfiability of two-variable logic over data words
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Alternating automata on data trees and XPath satisfiability
ACM Transactions on Computational Logic (TOCL)
Artifact systems with data dependencies and arithmetic
Proceedings of the 14th International Conference on Database Theory
Comparing workflow specification languages: a matter of views
Proceedings of the 14th International Conference on Database Theory
Two-variable logic on data words
ACM Transactions on Computational Logic (TOCL)
Algorithmic nominal game semantics
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Variable tree automata over infinite ranked alphabets
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Planarity of knots, register automata and logspace computability
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Dynamic behavior matching: a complexity analysis and new approximation algorithms
CADE'11 Proceedings of the 23rd international conference on Automated deduction
On the use of guards for logics with data
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
An automaton over data words that captures EMSO logic
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Automatic verification of data-centric business processes
BPM'11 Proceedings of the 9th international conference on Business process management
Expressiveness of Hybrid Temporal Logic on Data Words
Electronic Notes in Theoretical Computer Science (ENTCS)
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Symbolic finite state transducers: algorithms and applications
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automata and logics for words and trees over an infinite alphabet
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Model checking of linearizability of concurrent list implementations
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Automatic verification of parameterized data structures
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Comparing workflow specification languages: A matter of views
ACM Transactions on Database Systems (TODS)
Program equivalence in a simple language with state
Computer Languages, Systems and Structures
Regular expressions for data words
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Feasible automata for two-variable logic with successor on data words
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Regular path queries on graphs with data
Proceedings of the 15th International Conference on Database Theory
Algorithmic analysis of array-accessing programs
ACM Transactions on Computational Logic (TOCL)
Artifact systems with data dependencies and arithmetic
ACM Transactions on Database Systems (TODS)
Efficient reasoning about data trees via integer linear programming
ACM Transactions on Database Systems (TODS)
Finite automata over structures
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
An Automata Model for Trees with Ordered Data Values
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Regular Expressions for Languages over Infinite Alphabets
Fundamenta Informaticae
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
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
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
On XPath with transitive axes and data tests
Proceedings of the 32nd symposium on Principles of database systems
Proceedings of the 32nd symposium on Principles of database systems
Verification of relational data-centric dynamic systems with external services
Proceedings of the 32nd symposium on Principles of database systems
Graph Reachability and Pebble Automata over Infinite Alphabets
ACM Transactions on Computational Logic (TOCL)
Vibes: A visual language for specifying behavioral requirements of algorithms
Journal of Visual Languages and Computing
Extending two-variable logic on data trees with order on data values and its automata
ACM Transactions on Computational Logic (TOCL)
Regular Functions and Cost Register Automata
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
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 |
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, nondeterministic, and alternating control. We investigate the expressiveness and complexity of the automata and their connection to the logics, as well as standard decision problems. Some of our results answer open questions of Kaminski and Francez on register automata.