Logical Theory of the Monoid of Languages over a Non Tally Alphabet

DOI10.3233/FI-2015-1205zbMath1335.03036OpenAlexW1619417257MaRDI QIDQ2805453

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

zbMATH Keywords

undecidabilitygeneratorsconcatenationcommutative submonoidsmaximal submonoids

Mathematics Subject Classification ID

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

Related Items (2)

Monadic Theory of a Linear Order Versus the Theory of its Subsets with the Lifted Min/Max Operations ⋮ Logical Theory of the Additive Monoid of Subsets of Natural Integers

This page was built for publication: Logical Theory of the Monoid of Languages over a Non Tally Alphabet