Cận dưới độ phức tạp Otomat hữu hạn đoán nhận siêu ngôn ngữ chính quy

Đặng Huy Ruận, Phùng Văn Ổn

Abstract


Some results of regular hyper-language [1] and the complexity of finite automaton recognizing regular hyper-language [2] are considered.

In this paper we consider the lower limits of the complexity of finite automaton recognizing regular hyper-language.


Refbacks

  • There are currently no refbacks.


Journal of Computer Science and Cybernetics ISSN: 1813-9663

Published by Vietnam Academy of Science and Technology