A hardest language recognized by two-way nondeterministic pushdown automata (Q1158974): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users 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/0020-0190(81)90045-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2034634077 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Hardest Context-Free Language / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the existence of generators for certain AFL / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 13:29, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A hardest language recognized by two-way nondeterministic pushdown automata |
scientific article |
Statements
A hardest language recognized by two-way nondeterministic pushdown automata (English)
0 references
1981
0 references
language recognition
0 references
