Bideterministic automata and minimal representations of regular languages

Autor: Tamm, Hellis *, Ukkonen, Esko
Zdroj: In Theoretical Computer Science 2004 328(1):135-149
Databáze: ScienceDirect