On deterministic finite automata and syntactic monoid size☆
Under an Elsevier user license
open archive
Keywords
Automata theory
Deterministic finite automata
Syntactic monoids
Cited by (0)
- ☆
This paper is a completely revised and expanded version of two papers presented at the 6th and 7th Conference on Developments in Language Theory (DLT) held in Kyoto, Japan, September 18–21, 2002 and in Szeged, Hungary, July 7–11, 2003, respectively.
- 1
Part of the work was done while the author was at Institut für Informatik, Technische Universität München, Boltzmannstraße 3, D-85748 Garching bei München, Germany.
Copyright © 2004 Elsevier B.V. All rights reserved.