Logical theory of the monoid of languages over a non tally alphabet

DOI10.3233/FI-2015-1205zbMATH Open1335.03036OpenAlexW1619417257MaRDI QIDQ2805453FDOQ2805453

Authors: Serge Grigorieff, Christian Choffrut 

Publication date: 11 May 2016

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2015-1205

Recommendations

• On undecidability of concatenation theory for one-symbol languages
• Logical Theory of the Additive Monoid of Subsets of Natural Integers
• Data monoids
• Theories of orders on the set of words
• Nominal monoids

zbMATH Keywords

generatorsundecidabilityconcatenationcommutative submonoidsmaximal submonoids

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Cited In (9)

• Logical Theory of the Additive Monoid of Subsets of Natural Integers
• Data monoids
• Monadic theory of a linear order versus the theory of its subsets with the lifted min/max operations
• Bi-interpretability of some monoids with the arithmetic and applications
• RATIONAL LANGUAGES AND INVERSE MONOID PRESENTATIONS
• Title not available (Why is that?)
• Counting monoids and rational languages
• Nominal monoids
• On languages over an alphabet interpreted in a boolean algebra

This page was built for publication: Logical theory of the monoid of languages over a non tally alphabet

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