Funder
Natural Sciences and Engineering Research Council of Canada
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference26 articles.
1. Faster algorithms for the shortest path problem;Ahuja;J. ACM,1990
2. Introduction to Algorithms;Cormen,2009
3. Finding the growth rate of a regular or context-free language in polynomial time;Gawrychowski;Int. J. Found. Comput. Sci.,2010
4. Descriptional complexity of machines with limited resources;Goldstine;J. Univers. Comput. Sci.,2002
5. On measuring nondeterminism in regular languages;Goldstine;Inf. Comput.,1990
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Maximal Existential and Universal Width;Scientific Annals of Computer Science;2023-05-29
2. An Improved Quad-Array Trie Algorithm for Website Sensitive Word Detection;Proceedings of the 2023 9th International Conference on Computing and Artificial Intelligence;2023-03-17
3. Deciding path size of nondeterministic (and input-driven) pushdown automata;Theoretical Computer Science;2023-01
4. Existential and Universal Width of Alternating Finite Automata;Descriptional Complexity of Formal Systems;2023