MONOIDS AND COMPUTATIONS
From MaRDI portal
Publication:4658713
DOI10.1142/S0218196704001979zbMath1088.68601OpenAlexW2018331071MaRDI QIDQ4658713
Publication date: 18 March 2005
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196704001979
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Equivalence and equation solvability problems for the alternating group \(\mathbf A_4\). ⋮ WEAKLY ITERATED BLOCK PRODUCTS AND APPLICATIONS TO LOGIC AND COMPLEXITY ⋮ An assertion concerning functionally complete algebras and NP-completeness ⋮ An Algebraic Perspective on Boolean Function Learning ⋮ Evaluation of polynomials over finite rings via additive combinatorics
Cites Work
- Unnamed Item
- Categories as algebra: An essential ingredient in the theory of monoids
- \(NC^ 1\): The automata-theoretic viewpoint
- Non-uniform automata over groups
- The kernel of monoid morphisms
- Locally trivial categories and unambiguous concatenation
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Two-sided wreath product of categories
- Sur le produit de concatenation non ambigu
- An ergodic theorem for read-once non-uniform deterministic finite automata
- Algebra complexity problems involving graph homomorphism, semigroups and the constraint satisfaction problem
- On the expressive power of temporal logic
- Finite monoids and the fine structure of NC 1
- A Uniform Circuit Lower Bound for the Permanent
- An Application of Hindman's Theorem to a Problem on Communication Complexity
This page was built for publication: MONOIDS AND COMPUTATIONS
