http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
. Introduction to finite automata -- 2. Recognisable languages -- 3. Non-deterministic automata -- 4. [epsilon]-automata -- 5. Kleene?s Theorem -- 6. Local languages -- 7. Minimal automata -- 8. The transition monoid -- 9. The syntactic monoid -- 10. Algebraic language theory -- 11. Star-free languages -- 12. Varieties of languages -- A. Discrete mathematics
Includes bibliographical references (p. 293-301) and index