Inverse monoids of dot-depth two
Theoretical Computer Science
New results on the generalized star-height problem
Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science on STACS 89
The Compilation of Regular Expressions into Integrated Circuits
Journal of the ACM (JACM)
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Compression of individual sequences via variable-rate coding
IEEE Transactions on Information Theory
Subset construction complexity for homogeneous automata, position automata and ZPC-structures
Theoretical Computer Science
Direct and dual laws for automata with multiplicities
Theoretical Computer Science
Autographe: A Graphical Version of Automate
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Determinization of Glushkov Automata
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
SEA: A Symbolic Environment for Automata Theory
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Glushkov Construction for Multiplicities
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Grail: a C++ library for finite-state machines and regular expressions
CASCON '94 Proceedings of the 1994 conference of the Centre for Advanced Studies on Collaborative research
Interactive manipulation of regular objects with FAdo
ITiCSE '05 Proceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
A package TESTAS for checking some kinds of testability
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
A framework for benchmarking FA-based string recognizers
SAICSIT '10 Proceedings of the 2010 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists
COMPAS: a computing package for synchronization
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
From sequential extended regular expressions to NFA with symbolic labels
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
| Hi-index | 0.00 |
AUTOMATE is a package for symbolic computation on finite automata, extended rational expressions and finite semigroups. On the one hand, it enables one to compute the deterministic minimal automaton of the language represented by a rational expression or given by its table. On the other hand, given the transition table of a deterministic automaton, AUTOMATE computes the associated transition monoid. The regular D-classes structure, and many properties of the elements in the monoid are provided. The program AUTOMATE has been written in C and is quite portable. The user interface includes specialized editors for easy displaying of the computed results.