Algorithms Based on Finite Automata for Testing of Z-codes

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-01551321
Contributor : Hal Ifip <>
Submitted on : Friday, June 30, 2017 - 10:35:39 AM
Last modification on : Friday, December 1, 2017 - 1:10:01 AM
Long-term archiving on : Monday, January 22, 2018 - 7:25:00 PM

File

978-3-642-35606-3_74_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Dang Thang, Nguyen Han, Phan 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⟩

Share

Metrics

Record views

74

Files downloads

92