Application of hierarchical classifier to minimal synchronizing word problem

Authors:
Igor T. Podolak;Adam Roman;Dariusz Jędrzejczyk
Affiliations:
Institute of Computer Science, Jagiellonian University, Poland;Institute of Computer Science, Jagiellonian University, Poland;Institute of Computer Science, Jagiellonian University, Poland
Venue:
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part I
Year:
2012

Citing 13
Cited 0

Reset sequences for monotonic automata

SIAM Journal on Computing
Exact calculation of synchronization sequences based on binary decision diagrams

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
8.2 On Synchronizing Sequences and Test Sequence Partitioning

VTS '98 Proceedings of the 16th IEEE VLSI Test Symposium
A Conformance Testing Method for Communication Protocols Modeled as Concurrent DFSMs-Treatment of Non-observable Non-determinism-Atsushi

ICOIN '01 Proceedings of the The 15th International Conference on Information Networking
Model-Based Testing of Reactive Systems: Advanced Lectures (Lecture Notes in Computer Science)

Model-Based Testing of Reactive Systems: Advanced Lectures (Lecture Notes in Computer Science)
Hierarchical classifier with overlapping class groups

Expert Systems with Applications: An International Journal
An algorithmic approach to the automated design of parts orienters

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Genetic Algorithm for Synchronization

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Synchronizing monotonic automata

DLT'03 Proceedings of the 7th international conference on Developments in language theory
A hierarchical classifier with growing neural gas clustering

ICANNGA'09 Proceedings of the 9th international conference on Adaptive and natural computing algorithms
The complexity of finding reset words in finite automata

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
An efficient algorithm finds noticeable trends and examples concerning the Černy conjecture

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
CORES: fusion of supervised and unsupervised training methods for a multi-class classification problem

Pattern Analysis & Applications

Quantified Score

Hi-index	0.00

Visualization

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.