A modification of a substitution theorem and some necessary and sufficient conditions for sets to be context-free (Q5597529): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5576254 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Mappings which preserve context sensitive languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A New Normal-Form Theorem for Context-Free Phrase Structure Grammars / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Discontinuity and asymmetry in phrase structure grammars / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Two-way languages / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:58, 12 June 2024
scientific article; zbMATH DE number 3317756
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A modification of a substitution theorem and some necessary and sufficient conditions for sets to be context-free |
scientific article; zbMATH DE number 3317756 |
Statements
A modification of a substitution theorem and some necessary and sufficient conditions for sets to be context-free (English)
0 references
1970
0 references
languages, automata, networks
0 references
