Abstract
This chapter introduces deterministic finite-state machines. In addition, it presents a design recipe for state machines. This chapter also discusses how to prove the correctness of a deterministic finite-state machine for a given language.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Morazán, M.T. (2024). Deterministic Finite-State Machines. In: Programming-Based Formal Languages and Automata Theory. Texts in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-031-43973-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-031-43973-5_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-43972-8
Online ISBN: 978-3-031-43973-5
eBook Packages: Computer ScienceComputer Science (R0)