On real time one-way cellular array
Theoretical Computer Science
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
Two Families of Languages Related to ALGOL
Journal of the ACM (JACM)
A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
Journal of the ACM (JACM)
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
The hardest linear conjunctive language
Information Processing Letters
Parsing expression grammars: a recognition-based syntactic foundation
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The circuit value problem is log space complete for P
ACM SIGACT News
On the number of nonterminals in linear conjunctive grammars
Theoretical Computer Science
Information and Computation
Theoretical Computer Science - Mathematical foundations of computer science 2004
Recursive descent parsing for Boolean grammars
Acta Informatica
Well-founded semantics for Boolean grammars
Information and Computation
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
Theory of Computing Systems - Special Issue: Symposium on Computer Science, Guest Editors: Sergei Artemov, Volker Diekert and Dima Grigoriev
Real-time language recognition by one-dimensional cellular automata
Journal of Computer and System Sciences
Small weakly universal turing machines
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
P-completeness of cellular automaton rule 110
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Expressive power of LL(k) Boolean grammars
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Hi-index | 5.23 |
A variant of the Circuit Value Problem is introduced, in which every gate implements the NOR function @?(x@?y), and one of the inputs of every kth 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, which can be succinctly represented by language equations of several types. Using this representation, a conjunctive grammar with 8 rules, a Boolean grammar with 5 rules and an LL(1) Boolean grammar with 8 rules for this language are constructed. Another encoding of the problem is represented by a trellis automaton with 11 states and a linear conjunctive grammar with 20 rules.