Automata theory in nominal sets
From MaRDI portal
Abstract: We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensuing automata theory, where the key role is played by an automorphism group of the alphabet. In the process, we generalize nominal sets due to Gabbay and Pitts.
Recommendations
Cited in
(66)- Nominal automata with name binding
- A class of automata for the verification of infinite, resource-allocating behaviours
- Towards nominal context-free model-checking
- Towards nominal computation
- Regular and context-free nominal traces
- Coalgebraic semantics for nominal automata
- scientific article; zbMATH DE number 7561600 (Why is no real title available?)
- scientific article; zbMATH DE number 7561623 (Why is no real title available?)
- Pushdown normal-form bisimulation: a nominal context-free approach to program equivalence
- Equivariant ideals of polynomials
- Selective monitoring
- Orbit-finite-dimensional vector spaces and weighted register automata
- scientific article; zbMATH DE number 7453188 (Why is no real title available?)
- scientific article; zbMATH DE number 7577573 (Why is no real title available?)
- Reactive synthesis from visibly register pushdown automata
- scientific article; zbMATH DE number 7649885 (Why is no real title available?)
- scientific article; zbMATH DE number 7136664 (Why is no real title available?)
- Nondeterministic and co-nondeterministic implies deterministic, for data languages
- scientific article; zbMATH DE number 7559500 (Why is no real title available?)
- Learning nominal automata
- Coverability trees for Petri nets with unordered data
- From generic partition refinement to weighted tree automata minimization
- Polynomial-time equivalence testing for deterministic fresh-register automata
- On nominal regular languages with binders
- Bisimilarity in fresh-register automata
- Completeness of Nominal PROPs
- scientific article; zbMATH DE number 7566065 (Why is no real title available?)
- Selective monitoring
- Algebras of UTxO blockchains
- Descriptive set theoretic methods in automata theory. Decidability and topological complexity
- The fresh-graph of a nominal set
- A dichotomy for first-order reducts of unary structures
- Permutation groups with small orbit growth
- Function spaces for orbit-finite sets
- Active learning for deterministic bottom-up nominal tree automata
- On-the-fly bisimilarity checking for fresh-register automata
- Orbit-finite linear programming
- Syntactically and semantically regular languages of -terms coincide through logical relations
- scientific article; zbMATH DE number 7147443 (Why is no real title available?)
- Nominal tree automata with name allocation
- Bi-reachability in Petri nets with data
- Passive learning of regular data languages in polynomial time and data
- WQO dichotomy for 3-graphs
- Optimal run problem for weighted register automata
- Free functor from the category of G-nominal sets to that of 01-G-nominal sets
- SMT solving for functional programming over infinite structures
- scientific article; zbMATH DE number 7649944 (Why is no real title available?)
- Fast computations on ordered nominal sets
- scientific article; zbMATH DE number 7649889 (Why is no real title available?)
- Simple and subdirectly irreducible finitely supported \(Cb\)-sets
- $$\textsc {Reach}$$ on Register Automata via History Independence
- Reasoning on data words over numeric domains
- Solvability of orbit-finite systems of linear equations
- A taxonomy and reductions for common register automata formalisms
- On nominal sets with support-preorder
- Complete test suites for automata in monoidal closed categories
- scientific article; zbMATH DE number 7471718 (Why is no real title available?)
- Variable automata over infinite alphabets
- Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
- The language of stratified sets is confluent and strongly normalising
- \(\mathbb {N}\)-memory automata over the alphabet \(\mathbb {N}\)
- Completeness and incompleteness in nominal Kleene algebra
- Nominal Kleene coalgebra
- General lower bounds and improved algorithms for infinite-domain CSPs
- Solving Infinite Games in the Baire Space
- Generic partition refinement and weighted tree automata
This page was built for publication: Automata theory in nominal sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2878750)
