Regular Languages

Yuqi Guo, Yun Liu and Shoufeng Wang
Additional contact information
Yuqi Guo: Lanzhou University, School of Mathematics and Statistics
Yun Liu: Yuxi Normal University, Department of Mathematics
Shoufeng Wang: Yunnan Normal University, Department of Mathematics

Chapter Chapter 3 in Topics on Combinatorial Semigroups, 2024, pp 77-102 from Springer

Abstract: Abstract In this chapter, some selected topics of regular languages are involved. The contents of the chapter can be divided into two parts. In Sects. 3.1–3.3, a brief introduction to the theory of regular languages, including the automata theory of regular languages and the equivalence of the three concepts of languages: regularity, recognizability and rationality, are given. This part is classical and elementary and can be found in many books on the theory of formal languages and automata. The second part (Sects. 3.4–3.5) introduces some special topics of regular languages such as some decompositions of regular languages and restricted Burnside problem of semigroups (which is related to regular languages).

Date: 2024
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-981-99-9171-6_3

Ordering information: This item can be ordered from
http://www.springer.com/9789819991716

DOI: 10.1007/978-981-99-9171-6_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().