Abstract
An alphabet is a finite set of symbols. The set of all finite strings over a fixed alphabet X is denoted by X ⋆. X ⋆ includes the empty string ε. A subset L⊆X ⋆ is called a language over alphabet X.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
By the given definition in agreement with standard textbooks (see [63]), a DFA must be a complete FA, but a complete FA does not need to be deterministic.
- 2.
This definition is an abstraction to languages of the most common definition of Moore automata/finite state machines.
- 3.
Use the same order I ×U ×O in the languages (L 1) ↑O and (L 2) ↑I .
- 4.
It is not uncommon in practice to find that \(\vert \tilde{S}\vert \leq \vert S\vert \).
- 5.
Apply the closure construction to obtain an equivalent deterministic finite automaton without ε-moves.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Villa, T., Yevtushenko, N., Brayton, R.K., Mishchenko, A., Petrenko, A., Sangiovanni-Vincentelli, A. (2012). Equations Over Languages and Finite Automata. In: The Unknown Component Problem. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-68759-9_2
Download citation
DOI: https://doi.org/10.1007/978-0-387-68759-9_2
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34532-1
Online ISBN: 978-0-387-68759-9
eBook Packages: EngineeringEngineering (R0)