hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.20532/cit.2016.1002867

Efficient Implementation for Deterministic Finite Tree Automata Minimization

Younes Guellouma ; Laboratoire LIM, Université Amar Telidji de Laghouat, Laghouat, Algérie
Hadda Cherroun ; Laboratoire LIM, Université Amar Telidji de Laghouat, Laghouat, Algérie

Puni tekst: engleski, pdf (353 KB) str. 311-322 preuzimanja: 361* citiraj
APA 6th Edition
Guellouma, Y. i Cherroun, H. (2016). Efficient Implementation for Deterministic Finite Tree Automata Minimization. Journal of computing and information technology, 24 (4), 311-322. https://doi.org/10.20532/cit.2016.1002867
MLA 8th Edition
Guellouma, Younes i Hadda Cherroun. "Efficient Implementation for Deterministic Finite Tree Automata Minimization." Journal of computing and information technology, vol. 24, br. 4, 2016, str. 311-322. https://doi.org/10.20532/cit.2016.1002867. Citirano 02.03.2021.
Chicago 17th Edition
Guellouma, Younes i Hadda Cherroun. "Efficient Implementation for Deterministic Finite Tree Automata Minimization." Journal of computing and information technology 24, br. 4 (2016): 311-322. https://doi.org/10.20532/cit.2016.1002867
Harvard
Guellouma, Y., i Cherroun, H. (2016). 'Efficient Implementation for Deterministic Finite Tree Automata Minimization', Journal of computing and information technology, 24(4), str. 311-322. https://doi.org/10.20532/cit.2016.1002867
Vancouver
Guellouma Y, Cherroun H. Efficient Implementation for Deterministic Finite Tree Automata Minimization. Journal of computing and information technology [Internet]. 2016 [pristupljeno 02.03.2021.];24(4):311-322. https://doi.org/10.20532/cit.2016.1002867
IEEE
Y. Guellouma i H. Cherroun, "Efficient Implementation for Deterministic Finite Tree Automata Minimization", Journal of computing and information technology, vol.24, br. 4, str. 311-322, 2016. [Online]. https://doi.org/10.20532/cit.2016.1002867

Sažetak
We address the problem of deterministic finite tree automata (DFTA) minimization. We describe a new alternative to implement both standard and incremental tree automata minimization using a well-defined graph representing the automaton to be minimized. We show that the asymptotic complexity of the standard implementation is linearithmic and the incremental one is O(n3 log(n)) where n is the DFTA size.

Ključne riječi
automata theory; minimization; trees; asymptotic complexity

Hrčak ID: 173010

URI
https://hrcak.srce.hr/173010

Posjeta: 492 *