论文信息 - The Hardest LL(k) Language - 字舞流文

The Hardest LL(k) Language

Alexander Okhotin | Mikhail Mrykhin

[1] Maurice Nivat,et al. Le cylindre des langages linéaires , 2005, Mathematical systems theory.

[2] Sheila A. Greibach,et al. Jump PDA's and Hierarchies of Deterministic Context-Free Languages , 1974, SIAM J. Comput..

[3] Notes on top-down languages , 1969 .

[4] Jean-Michel Autebert,et al. Non-prinicipalité du cylindre des langages à compteur , 1977, Mathematical systems theory.

[5] Alexander Okhotin. Hardest languages for conjunctive and Boolean grammars , 2019, Inf. Comput..

[6] Alexander Okhotin,et al. A Tale of Conjunctive Grammars , 2018, DLT.

[7] Alexander Okhotin. Boolean grammars , 2004, Inf. Comput..

[8] Daniel J. Rosenkrantz,et al. Properties of Deterministic Top-Down Grammars , 1970, Inf. Control..

[9] Sheila A. Greibach,et al. The Hardest Context-Free Language , 1973, SIAM J. Comput..

[10] Alexander Okhotin,et al. On Hardest Languages for One-Dimensional Cellular Automata , 2021, LATA.

[11] Alexander Okhotin,et al. Homomorphisms Preserving Deterministic Context-Free Languages , 2013, Int. J. Found. Comput. Sci..