Abstract
The Boolean formula value problem asks for the Boolean output value of a given input formula. We code it as a formal language \(\ensuremath{{\cal D_+}}\subset\{a,b\}^*\). \({\cal D_+}\) is a nonregular, visibly pushdown language. We give automata for \({\cal D_+}\) 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 \({\cal D_+}\) are sketched.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alur, R.: Visibly Pushdown Languages. In: Proc. 36th ACM Symp. on Theory of Computing, pp. 202–211 (2004)
Alur, R., Kumar, V., Madhusudan, P., Viswanathan, M.: Congruences for Visibly Pushdown Languages. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1102–1114. Springer, Heidelberg (2005)
Barrington, D.A.: Bounded-width polynomial-size branching programs can recognize exactly those languages in NC1. J. Comp. System Sci. 38, 150–164 (1989)
Brumm, B.: Das Auswertungsproblem als formale Sprache. Private Communication (2011)
Buss, S.R.: The Boolean formula value problem is in ALOGTIME. In: Proc. 19th Ann. ACM Symp. on Theory of Computing, pp. 123–131 (1987)
Pin, J.E.: Varieties of Formal Languages. Plenum, London (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lange, KJ. (2012). The Boolean Formula Value Problem as Formal Language. In: Bordihn, H., Kutrib, M., Truthe, B. (eds) Languages Alive. Lecture Notes in Computer Science, vol 7300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31644-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-31644-9_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31643-2
Online ISBN: 978-3-642-31644-9
eBook Packages: Computer ScienceComputer Science (R0)