Nominal monoids
DOI10.1007/S00224-013-9464-1zbMATH Open1295.68163DBLPjournals/mst/Bojanczyk13OpenAlexW3188557745WikidataQ59303507 ScholiaQ59303507MaRDI QIDQ372971FDOQ372971
Authors: Mikołaj Bojańczyk 
Publication date: 21 October 2013
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-013-9464-1
Recommendations
first-order definabilitynominal setsaperiodic monoidsdata wordsorbit-finite monoidssyntactic monoids
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Theory of data (68P99)
Cites Work
- A new approach to abstract syntax with variable binding
- Automata and Logics for Words and Trees over an Infinite Alphabet
- Title not available (Why is that?)
- Title not available (Why is that?)
- Towards nominal computation
- Finite-memory automata
- An algebraic approach to data languages and timed languages
- An algebraic characterization of deterministic regular languages over infinite alphabets.
- Data monoids
- Automata vs. Logics on Data Words
Cited In (11)
- Logical theory of the monoid of languages over a non tally alphabet
- Title not available (Why is that?)
- Title not available (Why is that?)
- Data monoids
- Title not available (Why is that?)
- Toward model theory with data values
- Recognisable languages over monads
- Logics with rigidly guarded data tests
- 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
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)
