Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
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.
| Original language | English |
|---|---|
| Title of host publication | Machines, Computations, and Universality - 5th International Conference, MCU 2007, Proceedings |
| Pages | 267-278 |
| Number of pages | 12 |
| State | Published - 1 Dec 2007 |
| Event | 5th International Conference on Machines, Computations, and Universality, MCU 2007 - Orleans, France Duration: 10 Sep 2007 → 13 Sep 2007 |
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 4664 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
| Conference | 5th International Conference on Machines, Computations, and Universality, MCU 2007 |
|---|---|
| Country/Territory | France |
| City | Orleans |
| Period | 10/09/07 → 13/09/07 |
ID: 41143911