The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems (Q3457800)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems |
scientific article |
Statements
The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems (English)
0 references
17 December 2015
0 references
