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