Subject
General Computer Science,Theoretical Computer Science
Reference11 articles.
1. The Design and Analysis of Computer Algorithms;Aho,1974
2. Compilers, Principles, Techniques and Tools;Aho,1986
3. R.E. Bryant, Graph-based algorithms for boolean function manipulation, IEEE Trans. on Computers, C-35, (5) 677–691.
4. Partitioning a graph in O(∣A∣log2∣V∣);Cardon;Theoret. Comput. Sci.,1982
5. An algorithm for testing equivalence of finite automata;Hopcroft,1971
Cited by
96 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Operational State Complexity of Block Languages;Electronic Proceedings in Theoretical Computer Science;2024-09-11
2. Block Languages and Their Bitmap Representations;Lecture Notes in Computer Science;2024
3. Quantum Algorithm for Lexicographically Minimal String Rotation;Theory of Computing Systems;2023-10-24
4. Quick Subset Construction;Software: Practice and Experience;2023-08
5. State complexity of finite partial languages;Theoretical Computer Science;2023-07