A new algorithm for determining deciphering delay of regular language.

Đặng Quyết Thắng, Nguyễn Đình Hân, Phan Trung Huy


In this paper, we propose a new algorithm determining deciphering delay of regular language, which recognizes by a finite automaton  A. The algorithm has time complexity O(n^3), where n is the number of states and edges of  A.

DOI: https://doi.org/10.15625/1813-9663/28/2/2495 Display counter: Abstract : 160 views. PDF : 93 views. PDF (Tiếng Việt) : 15 views.


Journal of Computer Science and Cybernetics ISSN: 1813-9663

Published by Vietnam Academy of Science and Technology