Automata and Logics for Words and Trees over an Infinite Alphabet
From MaRDI portal
Publication:3613328
DOI10.1007/11874683_3zbMATH Open1225.68103OpenAlexW1542510688MaRDI QIDQ3613328FDOQ3613328
Authors: Luc Segoufin 
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
Recommendations
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)
Cited In (58)
- On the satisfiability of local first-order logics with data
- Reasoning About Data Trees Using CHCs
- Automata and grammars for data words
- Automatic program instrumentation for automatic verification
- Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words
- Dependency Tree Automata
- Tree Automata over Infinite Alphabets
- Title not available (Why is that?)
- Model checking usage policies
- On Pebble Automata for Data Languages with Decidable Emptiness Problem
- Synthesis of data word transducers
- Weak and nested class memory automata
- Generalized data automata and fixpoint logic
- Highly expressive query languages for unordered data trees
- A little bit infinite? On adding data to finitely labelled structures
- Reactive synthesis from visibly register pushdown automata
- Model checking memoryful linear-time logics over one-counter automata
- Title not available (Why is that?)
- Subsequence versus substring constraints in sequence pattern languages
- A Formal Framework for Complex Event Processing
- Title not available (Why is that?)
- Nondeterministic and co-nondeterministic implies deterministic, for data languages
- Toward model theory with data values
- Reachability in pushdown register automata
- Title not available (Why is that?)
- Querying best paths in graph databases
- Extended symbolic finite automata and transducers
- Title not available (Why is that?)
- An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
- An automaton over data words that captures EMSO logic
- Counting Multiplicity over Infinite Alphabets
- Logics of repeating values on data trees and branching counter systems
- Title not available (Why is that?)
- The containment problem for unambiguous register automata
- On the use of guards for logics with data
- The containment problem for unambiguous register automata and unambiguous timed automata
- Symbolic weighted language models, quantitative parsing and automated music transcription
- A succinct canonical register automaton model
- Survey on formal models to reason about infinite data values
- Prolog infinite trees and automata
- Morphisms on infinite alphabets, countable states automata and regular sequences
- Containment of queries for graphs with data
- Fast computations on ordered nominal sets
- Complexity results on register context-free grammars and related formalisms
- Symbolic tree automata
- The ``equal last letter predicate for words on infinite alphabets and classes of multitape automata
- Synthesis of Data Word Transducers
- A taxonomy and reductions for common register automata formalisms
- Regular expressions for data words
- \(\mathbb {N}\)-memory automata over the alphabet \(\mathbb {N}\)
- XML schema mappings, data exchange and metadata management
- On notions of regularity for data languages
- Nominal monoids
- Deadlock detection in linear recursive programs
- Nominal automata for resource usage control
- Decision Problems for Finite Automata over Infinite Algebraic Structures
- Nominal automata with name binding
- On pebble automata for data languages with decidable emptiness problem
This page was built for publication: Automata and Logics for Words and Trees over an Infinite Alphabet
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613328)
