Theoretical Computer Science
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Intractability of decision problems for finite-memory automata
Theoretical Computer Science - Special issue on universal machines and computations
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
An algebraic approach to data languages and timed languages
Information and Computation
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
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
Automata and logics for words and trees over an infinite alphabet
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Consistency of XML specifications
Inconsistency Tolerance
Adding nesting structure to words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Parameterized Complexity
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Counting Multiplicity over Infinite Alphabets
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Model checking memoryful linear-time logics over one-counter automata
Theoretical 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)
Alternating automata on data trees and XPath satisfiability
ACM Transactions on Computational Logic (TOCL)
Two-variable logic on data words
ACM Transactions on Computational Logic (TOCL)
Planarity of knots, register automata and logspace computability
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Algorithmic analysis of array-accessing programs
ACM Transactions on Computational Logic (TOCL)
Shuffle expressions and words with nested data
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
On the length of knot transformations via reidemeister moves i and II
RP'12 Proceedings of the 6th international conference on Reachability Problems
Graph Reachability and Pebble Automata over Infinite Alphabets
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
Motivated by considerations in XML theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position, a symbol and a data value from an infinite domain. Previous work has shown that it is not easy to come up with an expressive yet decidable automata model for data languages. Recently, such an automata model, data automata, was introduced. This paper introduces a simpler but equivalent model and investigates its expressive power, algorithmic and closure properties and some extensions.