Function spaces for orbit-finite sets
From MaRDI portal
Cites work
- A categorical framework for finite state machines
- Active learning of deterministic transducers with outputs in arbitrary monoids
- Automata theory in nominal sets
- Computational interpretations of linear logic
- Finite state machines for strings over infinite alphabets
- Finite-memory automata
- Generalizing determinization from automata to coalgebras
- scientific article; zbMATH DE number 1229489 (Why is no real title available?)
- scientific article; zbMATH DE number 1241700 (Why is no real title available?)
- scientific article; zbMATH DE number 786485 (Why is no real title available?)
- scientific article; zbMATH DE number 7559409 (Why is no real title available?)
- scientific article; zbMATH DE number 7199591 (Why is no real title available?)
- Implicit automata in -calculi. III: Affine planar string-to-string functions
- Implicit automata in typed -calculi I: aperiodicity in a non-commutative logic
- Nominal monoids
- Nominal sets. Names and symmetry in computer science
- Single-use automata and transducers for infinite alphabets
This page was built for publication: Function spaces for orbit-finite sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875052)