Abstract
The concept of regular expressions was introduced for the purpose of representing the languages accepted by deterministic finite automata. This is necessary in the analysis and synthesis of finite automata since the languages accepted by finite automata are usually infinite.
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
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Mordeson, J.N., Malik, D.S., Kuroki, N. (2003). Regular Fuzzy Expressions. In: Fuzzy Semigroups. Studies in Fuzziness and Soft Computing, vol 131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-37125-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-37125-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05706-9
Online ISBN: 978-3-540-37125-0
eBook Packages: Springer Book Archive