Characterizing derivation trees of context-free grammars through a generalization of finite automata theory (Q2526960): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Bracketed context-free languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tree acceptors and some of their applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5541339 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On certain formal properties of grammars / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5576254 / rank | |||
Normal rank |
Latest revision as of 21:40, 11 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Characterizing derivation trees of context-free grammars through a generalization of finite automata theory |
scientific article |
Statements
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory (English)
0 references
1967
0 references