Equations Over Languages and Finite Automata
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.
KeywordsComposition Operator Regular Expression Regular Language Finite Automaton Parallel Composition
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.
© Springer Science+Business Media, LLC 2012