Automata theory in nominal sets

From MaRDI portal
Publication:2878750


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


68Q45: Formal languages and automata

03E75: Applications of set theory


Related Items

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