The inclusion of the substitution closure of linear and one-counter languages in the largest sub-AFL of the family of algebraic languages is proper (Q1227278): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Sur diverses familles de langages fermées par transduction rationnelle / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computer programming and formal systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Relations Defined by Generalized Finite Automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5576254 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Chains of full AFL's / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A helpful result for proving inherent ambiguity / rank | |||
Normal rank | |||
Latest revision as of 19:00, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The inclusion of the substitution closure of linear and one-counter languages in the largest sub-AFL of the family of algebraic languages is proper |
scientific article |
Statements
The inclusion of the substitution closure of linear and one-counter languages in the largest sub-AFL of the family of algebraic languages is proper (English)
0 references
1973
0 references
