Automata and Formal Languages: Examples
Note: This is an archvied version of our old webpage. Some links might be broken. The current one can be found here.
Fixed length languages
- a part of the master automaton for fixed length languages:
PDF
- minimality preserving intersection of bounded automata: PDF
- the same intersection with using a more naive algorithm: PDF
- bottom-up minimization: PDF