Abstract
The Boolean formula value problem asks for the Boolean output value of a given input formula. We code it as a formal language. is a nonregular, visibly pushdown language. We give automata for which enable us to derive some of its syntactic equations. It is unknown whether the given list of equations is complete. Using these equations some algebraic properties of the syntactic monoid of are sketched. © 2012 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Lange, K. J. (2012). The boolean formula value problem as formal language. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7300 LNAI, 138–144. https://doi.org/10.1007/978-3-642-31644-9_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
