A logical characterization of data languages.
From MaRDI portal
Publication:1853115
DOI10.1016/S0020-0190(02)00229-6zbMath1042.68544MaRDI QIDQ1853115
Publication date: 21 January 2003
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00229-6
68P05: Data structures
Related Items
Separation logics and modalities: a survey, Optimal run problem for weighted register automata, A Note on C² Interpreted over Finite Data-Words, A succinct canonical register automaton model, On the freeze quantifier in Constraint LTL: Decidability and complexity, An algebraic approach to data languages and timed languages, Weighted register automata and weighted logic on data words, Reactive synthesis from visibly register pushdown automata, Complexity results on register context-free grammars and related formalisms, Nominal Automata for Resource Usage Control, Two-Variable Separation Logic and Its Inner Circle, CLASS COUNTING AUTOMATA ON DATAWORDS, An Automaton over Data Words That Captures EMSO Logic, Weighted Register Automata and Weighted Logic on Data Words, Weight Assignment Logic, Counting Multiplicity over Infinite Alphabets
Uses Software
Cites Work