On AFL generators for finitely encoded AFA (Q2556749): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Turing machines with restricted memory access / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4066625 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Principal AFL / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Stack automata and compiling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Infinite Hierarchy of Context-Free Languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Checking automata and one-way stack languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Grammatical Characterization of One-Way Nondeterministic Stack Languages / rank | |||
Normal rank |
Latest revision as of 11:05, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On AFL generators for finitely encoded AFA |
scientific article |
Statements
On AFL generators for finitely encoded AFA (English)
0 references
1973
0 references