A simple P-complete problem and its language-theoretic representations (Q616494): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2010.09.015 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2010.09.015 / rank | |||
Normal rank | |||
Latest revision as of 22:19, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple P-complete problem and its language-theoretic representations |
scientific article |
Statements
A simple P-complete problem and its language-theoretic representations (English)
0 references
10 January 2011
0 references
language equations
0 references
conjunctive grammars
0 references
Boolean grammars
0 references
Trellis automata
0 references
circuit value problem
0 references
0 references
