Finite-State Automatons and Regular Expressions
摘要
This chapter introduces the closure properties of the languages accepted by finite-state automatons and the equivalence between finite-state automatons and regular expressions.