COMPAS - A Computing Package for Synchronization
From MaRDI portal
Publication:3073624
DOI10.1007/978-3-642-18098-9_9zbMath1297.68115OpenAlexW1591424963MaRDI QIDQ3073624
Publication date: 11 February 2011
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-18098-9_9
Formal languages and automata (68Q45) Software, source code, etc. for problems pertaining to computer science (68-04)
Related Items (4)
A multi-parameter analysis of hard problems on deterministic finite automata ⋮ COMPAS ⋮ Černý's conjecture and the road colouring problem ⋮ Computing the shortest reset words of synchronizing automata
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Introducing VAUCANSON
- Synchronizing monotonic automata
- Synchronizing automata with a letter of deficiency 2
- A series of slowly synchronizing automata with a zero state over a small alphabet
- Synchronizing finite automata with short reset words
- The range order of a product of i transformations from a finite full transformation semigroup
- AUTOMATE, a computing package for automata and finite semigroups
- Enumeration and generation with a string automata representation
- In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton
- Reset Sequences for Monotonic Automata
- Genetic Algorithm for Synchronization
- On two Combinatorial Problems Arising from Automata Theory
- Algorithms for computing finite semigroups
- An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
This page was built for publication: COMPAS - A Computing Package for Synchronization