Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids
From MaRDI portal
Publication:3525564
DOI10.1007/978-3-540-74456-6_15zbMATH Open1147.94325OpenAlexW2122058195MaRDI QIDQ3525564FDOQ3525564
Authors: Christoph Behle, A. 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
Recommendations
- Linear circuits, two-variable logic and weakly blocked monoids
- scientific article; zbMATH DE number 3871197
- scientific article; zbMATH DE number 3959282
- scientific article; zbMATH DE number 512861
- scientific article; zbMATH DE number 988809
- Bistructures, bidomains and linear logic
- Circuits and Expressions over Finite Semirings
- Finite Monoids: From Word to Circuit Evaluation
- Arithmetic Circuits, Monomial Algebras and Finite Automata
- Two-Variable Logic over Countable Linear Orderings
Cited In (7)
- 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
- A language-theoretical approach to descriptive complexity
- Regular Languages Definable by Majority Quantifiers with Two Variables
- Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG]
- Title not available (Why is that?)
This page was built for publication: Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525564)
