%0 Conference Proceedings
%T Algorithms Based on Finite Automata for Testing of Z-codes
%+ Nam Dinh University of Technology and Education
%+ Hung Yen University of Technology and Education
%+ Hanoi University of Science and Technology (HUST)
%A Thang, Dang, Quyet
%A Han, Nguyen, Dinh
%A Huy, Phan, Trung
%Z Part 13: UMAS
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 9th International Conference on Network and Parallel Computing (NPC)
%C Gwangju, South Korea
%Y James J. Park
%Y Albert Zomaya
%Y Sang-Soo Yeo
%Y Sartaj Sahni
%I Springer
%3 Network and Parallel Computing
%V LNCS-7513
%P 625-635
%8 2012-09-06
%D 2012
%R 10.1007/978-3-642-35606-3_74
%K deterministic automata
%K bipolar
%K quadratic algorithm
%K Z-code
%Z Computer Science [cs]Conference papers
%X In this paper, we propose an algorithm to decide whether a regular language recognized by finite automata is a Z-code or not. This algorithm has time complexity O(n4) for the general case of non-deterministic automata, O(n2) for the restricted case of deterministic automata, where n is the number of states of finite automata.
%G English
%Z TC 10
%Z WG 10.3
%2 https://inria.hal.science/hal-01551321/document
%2 https://inria.hal.science/hal-01551321/file/978-3-642-35606-3_74_Chapter.pdf
%L hal-01551321
%U https://inria.hal.science/hal-01551321
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-AICT
%~ IFIP-TC
%~ IFIP-TC10
%~ IFIP-NPC
%~ IFIP-WG10-3
%~ IFIP-LNCS-7513