Theoretical Computer Science
A logical characterization of data languages
Information Processing Letters
Towards Regular Languages over Infinite Alphabets
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
An Algebraic Characterization of Data and Timed Languages
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
Temporal Logic with Predicate "-Abstraction
TIME '05 Proceedings of the 12th International Symposium on Temporal Representation and Reasoning
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
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On the Computational Power of Querying the History
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Automata and logics for words and trees over an infinite alphabet
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Adding nesting structure to words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
On notions of regularity for data languages
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
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 the theory of automata over infinite alphabets, a central difficulty is that of finding a suitable compromise between expressiveness and algorithmic complexity. We propose an automaton model where we count the multiplicity of data values on an input word. This is particularly useful when such languages represent behaviour of systems with unboundedly many processes, where system states carry such counts as summaries. A typical recognizable language is: "every process does at most k actions labelled a ". We show that emptiness is elementarily decidable, by reduction to the covering problem on Petri nets.