Equivalence problems for deterministic context-free languages and monadic recursion schemes (Q1238426): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Decidable Properties of Monadic Functional Schemas / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5526125 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4146243 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Deterministic context free languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Jump PDA’s and Hierarchies of Deterministic Context-Free Languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Strict deterministic grammars / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4072875 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Real-Time Definable Languages / rank | |||
Normal rank | |||
Revision as of 20:37, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalence problems for deterministic context-free languages and monadic recursion schemes |
scientific article |
Statements
Equivalence problems for deterministic context-free languages and monadic recursion schemes (English)
0 references
1977
0 references
