Author:
Aho A.V.,Hopcroft J.E.,Ullman J.D.
Reference10 articles.
1. Context-free grammars and pushdown storage;Chomsky,1965
2. An n2-recognizer for context free grammars;Earley,1967
3. Deterministic context-free languages;Ginsburg;Inform. Control,1966
4. Two-way pushdown automata;Gray;Inform. Control,1967
5. On the computational complexity of algorithms;Hartmanis;Trans. Am. Math. Soc.,1965
Cited by
55 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Dynamic Transitive Closure-based Static Analysis through the Lens of Quantum Search;ACM Transactions on Software Engineering and Methodology;2024-06-04
2. Sweeping Input-Driven Pushdown Automata;Implementation and Application of Automata;2023
3. CFL/Dyck Reachability;ACM SIGLOG News;2022-10
4. Subcubic certificates for CFL reachability;Proceedings of the ACM on Programming Languages;2022-01-12
5. An Experiment in Ping-Pong Protocol Verification by Nondeterministic Pushdown Automata;Electronic Proceedings in Theoretical Computer Science;2018-03-23