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