Algorithms Based on Finite Automata for Testing of Z-codes - Network and Parallel Computing Access content directly
Conference Papers Year : 2012

Algorithms Based on Finite Automata for Testing of Z-codes

Dang Quyet Thang
  • Function : Author
  • PersonId : 1011204
Nam Dinh University of Technology and Education
Nguyen Dinh Han
  • Function : Author
  • PersonId : 1011205
Hung Yen University of Technology and Education
Phan Trung Huy
  • Function : Author
  • PersonId : 1011206
Hanoi University of Science and Technology

Abstract

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.

Domains

Computer Science [cs]
Fichier principal
Vignette du fichier
978-3-642-35606-3_74_Chapter.pdf (324.77 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Hal Ifip  : Connect in order to contact the contributor

https://inria.hal.science/hal-01551321

Submitted on : Friday, June 30, 2017-10:35:39 AM

Last modification on : Wednesday, April 6, 2022-3:14:02 PM

Long-term archiving on: Monday, January 22, 2018-7:25:00 PM

Download

Dates and versions

hal-01551321 , version 1 (30-06-2017)

Licence

Attribution

Identifiers

Cite

Dang Quyet Thang, Nguyen Dinh Han, Phan Trung Huy. Algorithms Based on Finite Automata for Testing of Z-codes. 9th International Conference on Network and Parallel Computing (NPC), Sep 2012, Gwangju, South Korea. pp.625-635, ⟨10.1007/978-3-642-35606-3_74⟩. ⟨hal-01551321⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

IFIP-LNCS IFIP IFIP-AICT IFIP-TC IFIP-TC10 IFIP-NPC IFIP-WG10-3 IFIP-LNCS-7513
50 View
57 Download

Altmetric

Share

Gmail Facebook X LinkedIn More