Finite Automata
Prelims
Chapter 1 - Introduction to finite automata
Chapter 2 - Recognisable languages
Chapter 3 - Non-deterministic automata
Chapter 4 - ε -automata
Chapter 5 - Kleene's Theorem
Chapter 6 - Local languages
Chapter 7 - Minimal automata
Chapter 8 - The transition monoid
Chapter 9 - The syntactic monoid
Chapter 10 - Algebraic language theory
Chapter 11 - Star-free languages
Chapter 12 - Varieties of languages
Appendix A - Discrete mathematics
Bibliography
Index
评分
评分
评分
评分
本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度,google,bing,sogou 等
© 2025 book.wenda123.org All Rights Reserved. 图书目录大全 版权所有