Determination of finite automata accepting subregular languages

Henning Bordihn, Markus Holzer, Martin Kutrib. Determination of finite automata accepting subregular languages. Theoretical Computer Science, 410(35):3209-3222, 2009. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.