Abstract
We present a practical application of Hierarchical Classifier with overlapping clusters to the problem of finding the minimal synchronizing word length of a given finite automaton. We compare our approach with a single neural network model. Using a certain representation of automaton as the classifier's input we improve HC efficiency and we are able to analyze the relation between particular automata features and minimal synchronizing lengths. © 2012 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Podolak, I. T., Roman, A., & Jȩdrzejczyk, D. (2012). Application of Hierarchical Classifier to minimal synchronizing word problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7267 LNAI, pp. 421–429). https://doi.org/10.1007/978-3-642-29347-4_49
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
