Abstract
You’ve seen how to describe sets of strings—or languages—using different kinds of finite automata. An automaton describes a language by accepting the strings in the language and rejecting the rest. It decides whether or not to accept a string via a mechanical computation process based on the sequence of symbols in the string.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Sannella, D., Fourman, M., Peng, H., Wadler, P. (2021). Regular Expressions. In: Introduction to Computation. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-76908-6_31
Download citation
DOI: https://doi.org/10.1007/978-3-030-76908-6_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-76907-9
Online ISBN: 978-3-030-76908-6
eBook Packages: Computer ScienceComputer Science (R0)