Abstract
A variant of Circuit Value Problem over the basis of Peirce's arrow (NOR) is introduced, in which one of the inputs of every k-th gate must be the (k - 1)-th gate. The problem, which remains P-complete, is encoded as a simple formal language over a two-letter alphabet. It is shown that this language can be naturally and succinctly represented by language equations from several classes. Using this representation, a small conjunctive grammar and an even smaller LL(1) Boolean grammar for this language are constructed. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Okhotin, A. (2007). A simple P-complete problem and its representations by language equations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4664 LNCS, pp. 267–278). Springer Verlag. https://doi.org/10.1007/978-3-540-74593-8_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
