COMPAS: a computing package for synchronization

Authors:
Krzysztof Chmiel;Adam Roman
Affiliations:
DreamLab Onet.pl sp. z o.o., Kraków, Poland;Institute of Computer Science, Jagiellonian University in Cracow, Poland
Venue:
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Year:
2010

Citing 15
Cited 0

Reset sequences for monotonic automata

SIAM Journal on Computing
AUTOMATE, a computing package for automata and finite semigroups

Journal of Symbolic Computation
Algorithms for computing finite semigroups

FoCM '97 Selected papers of a conference on Foundations of computational mathematics
Synchronizing Finite Automata on Eulerian Digraphs

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Sur un Cas Particulier de la Conjecture de Cerny

Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Synchronizing monotonic automata

Theoretical Computer Science - Developments in language theory
Introducing VAUCANSON

Theoretical Computer Science - Implementation and application of automata
Synchronizing automata with a letter of deficiency 2

Theoretical Computer Science
Enumeration and generation with a string automata representation

Theoretical Computer Science
An algorithmic approach to the automated design of parts orienters

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
A series of slowly synchronizing automata with a zero state over a small alphabet

Information and Computation
Genetic Algorithm for Synchronization

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
A note on Černy conjecture for automata over 3-letter alphabet

Journal of Automata, Languages and Combinatorics
A package TESTAS for checking some kinds of testability

CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we describe COMPAS - the open-source computing package, dedicated to the computations on synchronizing automata. COMPAS design is based on a generic programming paradigm. This makes the package very powerful because of its flexibility and extensibility. The paper describes shortly the package architecture and its main algorithms and some examples of use. COMPAS allows to easily operate on synchronizing automata, verifying new synchronizing algorithms etc. To the best of our knowledge, this is the first such flexible, extensible and open-source package for synchronization.