Độ phức tạp otomat hữu hạn đoán nhận siêu ngôn ngữ chính quy
Author affiliations
DOI:
https://doi.org/10.15625/1813-9663/14/4/7964Abstract
We shall call the small possible number of states of a hyper-finite deterministic automaton, which recorgnizes the set of word L in the alphabet ∑, a complexity of a finite automaton of L, and denote by P(L). We have the following result:
For any hyper-generating schemar G, the complexity of a finite automaton of L(G) is:
P(L(G)) ≤ 2 D + 1.
Metrics
Metrics Loading ...
Downloads
Published
29-03-2016
How to Cite
[1]
Đặng H. Ruận and P. V. Ổn, “Độ phức tạp otomat hữu hạn đoán nhận siêu ngôn ngữ chính quy”, JCC, vol. 14, no. 4, p. 25–30, Mar. 2016.
Issue
Section
Computer Science
License
1. We hereby assign copyright of our article (the Work) in all forms of media, whether now known or hereafter developed, to the Journal of Computer Science and Cybernetics. We understand that the Journal of Computer Science and Cybernetics will act on my/our behalf to publish, reproduce, distribute and transmit the Work.2. This assignment of copyright to the Journal of Computer Science and Cybernetics is done so on the understanding that permission from the Journal of Computer Science and Cybernetics is not required for me/us to reproduce, republish or distribute copies of the Work in whole or in part. We will ensure that all such copies carry a notice of copyright ownership and reference to the original journal publication.
3. We warrant that the Work is our results and has not been published before in its current or a substantially similar form and is not under consideration for another publication, does not contain any unlawful statements and does not infringe any existing copyright.
4. We also warrant that We have obtained the necessary permission from the copyright holder/s to reproduce in the article any materials including tables, diagrams or photographs not owned by me/us.
