Data monoids

DOI10.4230/LIPICS.STACS.2011.105MaRDI QIDQ3113676zbMATH OpenFDO

Authors Mikołaj Bojańczyk

Publication date 23 January 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_5394.html

zbMATH Keywords

data wordsfirst-order logicmonoidMyhill-Nerode equivalencenominal set

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• Nominal monoids
• MSO definable text languages
• Logics with rigidly guarded data tests
• Logical theory of the monoid of languages over a non tally alphabet
• On the use of guards for logics with data

Cited in

(9)

• Free functor from the category of G-nominal sets to that of 01-G-nominal sets
• Nondeterministic and co-nondeterministic implies deterministic, for data languages
• Logical theory of the monoid of languages over a non tally alphabet
• On the use of guards for logics with data
• Logics with rigidly guarded data tests
• Nominal monoids
• Monotonic complements for independent data warehouses
• Stone duality, topological algebra, and recognition.
• Orbit-finite linear programming

This page was built for publication: Data monoids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3113676)