The following pages link to Automata theory in nominal sets (Q2878750):
Displaying 49 items.
- Regular and context-free nominal traces (Q530218) (← links)
- Descriptive set theoretic methods in automata theory. Decidability and topological complexity (Q737116) (← links)
- Simple and subdirectly irreducible finitely supported \(Cb\)-sets (Q1680555) (← links)
- Free functor from the category of \(G\)-nominal sets to that of 01-\(G\)-nominal sets (Q1797955) (← links)
- From generic partition refinement to weighted tree automata minimization (Q1982644) (← links)
- Permutation groups with small orbit growth (Q2037519) (← links)
- Coalgebraic semantics for nominal automata (Q2104476) (← links)
- Reactive synthesis from visibly register pushdown automata (Q2119985) (← links)
- Selective monitoring (Q2221805) (← links)
- Nondeterministic and co-nondeterministic implies deterministic, for data languages (Q2233422) (← links)
- Completeness and incompleteness in nominal Kleene algebra (Q2401017) (← links)
- General lower bounds and improved algorithms for infinite-domain CSPs (Q2700386) (← links)
- Coverability Trees for Petri Nets with Unordered Data (Q2811357) (← links)
- Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture (Q2822649) (← links)
- Nominal Automata with Name Binding (Q2988364) (← links)
- Nominal Kleene Coalgebra (Q3449483) (← links)
- A Dichotomy for First-Order Reducts of Unary Structures (Q4643958) (← links)
- (Q4643959) (← links)
- (Q4972736) (← links)
- Polynomial-time equivalence testing for deterministic fresh-register automata (Q5005176) (← links)
- Selective monitoring (Q5009434) (← links)
- (Q5013828) (← links)
- (Q5020647) (← links)
- (Q5028487) (← links)
- Solving Infinite Games in the Baire Space (Q5038566) (← links)
- On nominal sets with support-preorder (Q5053424) (← links)
- Algebras of UTxO blockchains (Q5084313) (← links)
- (Q5089311) (← links)
- (Q5091269) (← links)
- (Q5092332) (← links)
- (Q5094137) (← links)
- (Q5101342) (← links)
- Orbit-finite sets and their algorithms (Q5111332) (← links)
- (Q5207051) (← links)
- $$\mathbb {N}$$ -Memory Automata over the Alphabet $$\mathbb {N}$$ (Q5738989) (← links)
- (Q5875342) (← links)
- Tree automata as algebras: minimisation and determinisation (Q5875346) (← links)
- (Q5875398) (← links)
- Completeness of Nominal PROPs (Q5883754) (← links)
- Fast computations on ordered nominal sets (Q5918532) (← links)
- WQO dichotomy for 3-graphs (Q5919047) (← links)
- Optimal run problem for weighted register automata (Q5919052) (← links)
- A taxonomy and reductions for common register automata formalisms (Q6045033) (← links)
- The fresh-graph of a nominal set (Q6059081) (← links)
- $$\textsc {Reach}$$ on Register Automata via History Independence (Q6487290) (← links)
- Generic partition refinement and weighted tree automata (Q6535955) (← links)
- Orbit-finite-dimensional vector spaces and weighted register automata (Q6566474) (← links)
- Solvability of orbit-finite systems of linear equations (Q6649440) (← links)
- Reasoning on data words over numeric domains (Q6649469) (← links)
