Variable automata over infinite alphabets
From MaRDI portal
Publication:3564896
Recommendations
Cited in
(24)- An automata-theoretic approach to reasoning about parameterized systems and specifications
- On-the-fly bisimilarity checking for fresh-register automata
- scientific article; zbMATH DE number 7649933 (Why is no real title available?)
- On temporal logics with data variable quantifications: decidability and complexity
- Weighted variable automata over infinite alphabets
- Set augmented finite automata over infinite alphabets
- Nominal automata for resource usage control
- Forward and backward application of symbolic tree transducers
- Variable tree automata over infinite ranked alphabets
- Model checking usage policies
- Inferring Symbolic Automata
- Decision procedures for sequence theories
- Learning deterministic variable automata over infinite alphabets
- Nominal automata with name binding
- Document spanners: a formal approach to information extraction
- Extending two-variable logic on data trees with order on data values and its automata
- Regular expressions for data words
- A class of automata for the verification of infinite, resource-allocating behaviours
- Using variable automata for querying data graphs
- An automata-theoretic approach to model-checking systems and specifications over infinite data domains
- Regular and context-free nominal traces
- An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
- Layered memory automata: recognizers for quasi-regular languages with unbounded memory
- On the complexity of decision problems for parameterized finite state synchronous transducers
This page was built for publication: Variable automata over infinite alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564896)
