AUTOMATE

swMATH59MaRDI QIDQ12832FDOQ12832

Author name not available (Why is that?)

Described by source

• AUTOMATE, a computing package for automata and finite semigroups

Cited In (11)

• Computing finite semigroups
• Characterization of Glushkov automata
• From Sequential Extended Regular Expressions to NFA with Symbolic Labels
• COMPAS - A Computing Package for Synchronization
• Direct and dual laws for automata with multiplicities
• Some results on the dot-depth hierarchy
• Title not available (Why is that?)
• Re-describing an algorithm by Hopcroft
• Green's equivalences in finite semigroups of binary relations
• Subset construction complexity for homogeneous automata, position automata and ZPC-structures
• A conjecture on the concatenation product

This page was built for software: AUTOMATE