Automata and Logics for Words and Trees over an Infinite Alphabet
From MaRDI portal
Publication:3613328
DOI10.1007/11874683_3zbMath1225.68103OpenAlexW1542510688MaRDI QIDQ3613328
Publication date: 12 March 2009
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11874683_3
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)
Related Items
Reactive synthesis from visibly register pushdown automata ⋮ Highly expressive query languages for unordered data trees ⋮ On notions of regularity for data languages ⋮ On Pebble Automata for Data Languages with Decidable Emptiness Problem ⋮ Nominal Automata for Resource Usage Control ⋮ XML Schema Mappings ⋮ Reachability in pushdown register automata ⋮ Symbolic weighted language models, quantitative parsing and automated music transcription ⋮ Unnamed Item ⋮ Nominal monoids ⋮ Containment of queries for graphs with data ⋮ Unnamed Item ⋮ Complexity results on register context-free grammars and related formalisms ⋮ A taxonomy and reductions for common register automata formalisms ⋮ Unnamed Item ⋮ On pebble automata for data languages with decidable emptiness problem ⋮ Nominal Automata with Name Binding ⋮ Logics of Repeating Values on Data Trees and Branching Counter Systems ⋮ A succinct canonical register automaton model ⋮ Symbolic tree automata ⋮ Synthesis of Data Word Transducers ⋮ Nondeterministic and co-nondeterministic implies deterministic, for data languages ⋮ $$\mathbb {N}$$ -Memory Automata over the Alphabet $$\mathbb {N}$$ ⋮ Model checking usage policies ⋮ Deadlock Detection in Linear Recursive Programs ⋮ Model checking memoryful linear-time logics over one-counter automata ⋮ Subsequence versus substring constraints in sequence pattern languages ⋮ Unnamed Item ⋮ Fast computations on ordered nominal sets ⋮ Weak and Nested Class Memory Automata ⋮ Dependency Tree Automata ⋮ The containment problem for unambiguous register automata and unambiguous timed automata ⋮ Extended symbolic finite automata and transducers ⋮ An Automaton over Data Words That Captures EMSO Logic ⋮ The Containment Problem for Unambiguous Register Automata ⋮ A Formal Framework for Complex Event Processing ⋮ Decision Problems for Finite Automata over Infinite Algebraic Structures ⋮ Counting Multiplicity over Infinite Alphabets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Regular expressions for data words
