The Boolean Formula Value Problem as Formal Language
From MaRDI portal
Publication:3166948
DOI10.1007/978-3-642-31644-9_9zbMath1367.68171OpenAlexW46435304MaRDI QIDQ3166948
Publication date: 1 November 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31644-9_9
word equationsalgebraic approachsyntactic monoid\(\mathrm{TC}^{0}\) vs \(\mathrm{NC}^{1}\)Boolean formula value problem
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
This page was built for publication: The Boolean Formula Value Problem as Formal Language