Skip to content
Channels - Automata theory in nominal sets :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Automata theory in nominal sets
Search for more channels:
Similar Items: Automata theory in nominal sets
Channel Options
View Record
Explore related channels
Quick Look
Residuality and Learning for Nondeterministic Nominal Automata
Quick Look
A dependent nominal type theory
Quick Look
Completeness of Nominal PROPs
Quick Look
Coalgebraic Automata Theory: Basic Results
Quick Look
Full abstraction for nominal general references
Quick Look
Rule Formats for Nominal Process Calculi
Quick Look
On Nominal Syntax and Permutation Fixed Points
Quick Look
Modal Logics for Nominal Transition Systems
Quick Look
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
Quick Look
A Normalizing Intuitionistic Set Theory with Inaccessible Sets
Quick Look
Formalising the pi-calculus using nominal logic
Quick Look
General Bindings and Alpha-Equivalence in Nominal Isabelle
Quick Look
Constraint solving in non-permutative nominal abstract syntax
Quick Look
Nominal Coalgebraic Data Types with Applications to Lambda Calculus
Quick Look
From nominal to higher-order rewriting and back again
Quick Look
Representations of measurable sets in computable measure theory
Quick Look
The Complexity of Infinite Computations In Models of Set Theory
Quick Look
Psi-calculi: a framework for mobile processes with nominal data and logic
Quick Look
Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
Quick Look
First Order Theories of Some Lattices of Open Sets
Quick Look
Applicable Mathematics in a Minimal Computational Theory of Sets
Quick Look
Petri Automata
Quick Look
From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata
Quick Look
Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
Load more items
View Record
Prev
Explore related channels
Next