Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids
From MaRDI portal
Publication:3525564
DOI10.1007/978-3-540-74456-6_15zbMath1147.94325OpenAlexW2122058195MaRDI QIDQ3525564
Christoph Behle, Andreas Krebs, Mark Mercer
Publication date: 17 September 2008
Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_15
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Linear circuits, two-variable logic and weakly blocked monoids ⋮ Typed Monoids – An Eilenberg-Like Theorem for Non Regular Languages ⋮ The algebraic theory of Parikh automata ⋮ Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG] ⋮ A Language-Theoretical Approach to Descriptive Complexity ⋮ Regular Languages Definable by Majority Quantifiers with Two Variables
This page was built for publication: Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids