The complexity of some decision problems about two-dimensional array grammars (Q1062464): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5592246 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5656399 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3926078 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hierarchical Structures and Complexities of Parallel Isometric Languages / rank | |||
Normal rank | |||
Latest revision as of 18:39, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of some decision problems about two-dimensional array grammars |
scientific article |
Statements
The complexity of some decision problems about two-dimensional array grammars (English)
0 references
1983
0 references
The complexity of several decision problems concerning two-dimensional isometric array grammars (IAG) is studied. Because of the two-dimensional and the ''isometric'' properties of IAG, many decision problems become very hard to solve even for regular array grammars (RAG), the lowest subclass of IAG in the Chomsky-like hierarchy. In this paper, it is shown that the membership problems for RAGs and for context-free array grammars (CFAG) are both NP-complete. The emptiness problem and the equivalence problem for RAGs are shown to be undecidable.
0 references
two-dimensional isometric array grammars
0 references
regular array grammars
0 references
membership problems
0 references
context-free array grammars
0 references
emptiness problem
0 references
equivalence problem
0 references
