Automata theory in nominal sets

DOI10.2168/LMCS-10(3:4)2014zbMath1338.68140arXiv1402.0897MaRDI QIDQ2878750

Mikołaj Bojańczyk, Bartek Klin, Sławomir Lasota

Publication date: 5 September 2014

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.0897

zbMATH Keywords

automatanominal sets

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of set theory (03E75)

Related Items

Reactive synthesis from visibly register pushdown automata, Completeness of Nominal PROPs, Solving Infinite Games in the Baire Space, Nominal Kleene Coalgebra, On nominal sets with support-preorder, Unnamed Item, Completeness and incompleteness in nominal Kleene algebra, Unnamed Item, Algebras of UTxO blockchains, Simple and subdirectly irreducible finitely supported \(Cb\)-sets, A taxonomy and reductions for common register automata formalisms, The fresh-graph of a nominal set, Active learning for deterministic bottom-up nominal tree automata, On-the-fly bisimilarity checking for fresh-register automata, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, General lower bounds and improved algorithms for infinite-domain CSPs, Unnamed Item, Nominal Automata with Name Binding, Unnamed Item, Selective monitoring, Polynomial-time equivalence testing for deterministic fresh-register automata, Nondeterministic and co-nondeterministic implies deterministic, for data languages, From generic partition refinement to weighted tree automata minimization, Regular and context-free nominal traces, $$\mathbb {N}$$ -Memory Automata over the Alphabet $$\mathbb {N}$$, Unnamed Item, Unnamed Item, Unnamed Item, Fast computations on ordered nominal sets, Unnamed Item, WQO dichotomy for 3-graphs, Unnamed Item, Permutation groups with small orbit growth, Free functor from the category of \(G\)-nominal sets to that of 01-\(G\)-nominal sets, Coverability Trees for Petri Nets with Unordered Data, Optimal run problem for weighted register automata, Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture, A Dichotomy for First-Order Reducts of Unary Structures, Coalgebraic semantics for nominal automata, Unnamed Item