Recommendations
Cites work
- scientific article; zbMATH DE number 52907 (Why is no real title available?)
- scientific article; zbMATH DE number 618821 (Why is no real title available?)
- A new approach to abstract syntax with variable binding
- An algebraic approach to data languages and timed languages
- An algebraic characterization of deterministic regular languages over infinite alphabets.
- Automata and Logics for Words and Trees over an Infinite Alphabet
- Automata vs. Logics on Data Words
- Data monoids
- Finite-memory automata
- Towards nominal computation
Cited in
(14)- Logical theory of the monoid of languages over a non tally alphabet
- scientific article; zbMATH DE number 7561600 (Why is no real title available?)
- scientific article; zbMATH DE number 7561623 (Why is no real title available?)
- Data monoids
- scientific article; zbMATH DE number 7649885 (Why is no real title available?)
- Toward model theory with data values
- Recognisable languages over monads
- Logics with rigidly guarded data tests
- Function spaces for orbit-finite sets
- Single-use automata and transducers for infinite alphabets
- On the use of guards for logics with data
- Free functor from the category of G-nominal sets to that of 01-G-nominal sets
- Simple and subdirectly irreducible finitely supported \(Cb\)-sets
- Recognizing number
This page was built for publication: Nominal monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q372971)
