Nominal monoids
From MaRDI portal
Publication:372971
DOI10.1007/s00224-013-9464-1zbMath1295.68163OpenAlexW3188557745WikidataQ59303507 ScholiaQ59303507MaRDI QIDQ372971
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
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)
Related Items (6)
Recognisable Languages over Monads ⋮ Simple and subdirectly irreducible finitely supported \(Cb\)-sets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Free functor from the category of \(G\)-nominal sets to that of 01-\(G\)-nominal sets
Cites Work
- A new approach to abstract syntax with variable binding
- Finite-memory automata
- An algebraic approach to data languages and timed languages
- An algebraic characterization of deterministic regular languages over infinite alphabets.
- Towards nominal computation
- Automata vs. Logics on Data Words
- Automata and Logics for Words and Trees over an Infinite Alphabet
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Nominal monoids
