A simple P-complete problem and its language-theoretic representations (Q616494): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2010.09.015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1977695731 / rank | |||
Normal rank | |||
Latest revision as of 03:39, 20 March 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
