Author:
Gandhi Aniruddh,Khoussainov Bakhadyr,Liu Jiamou
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Birget, J.-C.: Intersection of regular languages and state complexity. ACM SIGACT News 22(2), 49 (1991)
2. Bojanczyk, M.: Decidable properties of tree languages. PhD Thesis. Warsaw University (2004)
3. Lecture Notes in Computer Science;C. Câmpeanu,2001
4. Dacuik, J., Watson, B.W., Watson, R.E.: Incremental Construction of Minimal Acyclic Finite State Automata and Transducers. In: Proc. of Finite State Methods in Natural Language Processing (FSMNLP 1998), pp. 48–56 (1998)
5. Gandhi, A., Ke, N.R., Khoussainov, B.: State complexity of determinization and complementation for finite automata. In: Proc. of CATS 2011, CRPIT, vol. 119, pp. 105–110 (2011)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A BSP Based Approach for NFAs Intersection;Algorithms and Architectures for Parallel Processing;2020