Author:
Goldstine Jonathan,Price John K.,Wotschke Detlef
Subject
General Computer Science,Theoretical Computer Science
Reference13 articles.
1. Economy of description by parsers, DPDAs and PDAs;Geller;Theoret. Comput. Sci.,1977
2. The Mathematical Theory of Context-Free Languages;Ginsburg,1966
3. Size complexity in context-free grammar forms;Ginsburg;J. ACM,1976
4. Finite-turn pushdown automata;Ginsburg;SIAM J. Control,1966
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Syntax checking either way;Theoretical Computer Science;2023-07
2. Subcubic certificates for CFL reachability;Proceedings of the ACM on Programming Languages;2022-01-12
3. Syntax Checking Either Way;Implementation and Application of Automata;2022
4. Detecting useless transitions in pushdown automata;Information and Computation;2021-08
5. Detecting Useless Transitions in Pushdown Automata;Language and Automata Theory and Applications;2017