The second-order monadic theory of the free inverse monoid is undecidable
From MaRDI portal
Publication:1280226
zbMath0913.03017MaRDI QIDQ1280226
Publication date: 14 March 1999
Published in: Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/119754
Cayley graphdecidabilityrecognizable setsfree inverse monoidmonadic second-order theorygeneralized wordsWang tiling systems
Combinatorics on words (68R15) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Related Items (2)
Inverse monoids: decidability and complexity of algebraic questions. ⋮ On one-relator groups and units of special one-relation inverse monoids
This page was built for publication: The second-order monadic theory of the free inverse monoid is undecidable
