WEAKLY ITERATED BLOCK PRODUCTS AND APPLICATIONS TO LOGIC AND COMPLEXITY
From MaRDI portal
Publication:3561125
DOI 10.1142/S0218196710005686</link>zbMath 1234.68275</link>OpenAlex W2031779562</link>MaRDI QID Q3561125</link>
Howard Straubing, Denis Thérien, Pascal Tesson
Publication date: 25 May 2010
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196710005686
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
Cites Work
- Categories as algebra: An essential ingredient in the theory of monoids
- Nesting until and since in linear temporal logic
- The kernel of monoid morphisms
- Definability with bounded number of bound variables
- Semidirect products of categories and applications
- Two-sided wreath product of categories
- Closure of varieties of languages under products with counter
- Profinite categories and semidirect products
- Regular languages defined by generalized first-order formulas with a bounded number of bound variables
- Complete classifications for the communication complexity of regular languages
- Regular languages defined with generalized quantifiers
- Methods of the algebraic theory of machines. I: Decomposition theorem for generalized machines; properties preserved under series and parallel compositions of machines
- Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size
- MONOIDS AND COMPUTATIONS
This page was built for publication: WEAKLY ITERATED BLOCK PRODUCTS AND APPLICATIONS TO LOGIC AND COMPLEXITY
