Open AccessBook
Regular languages
Sheng Yu
- 01 Apr 1997
pp 41-110
522
TL;DR: The class of regular sets is the smallest class of sets containing the finite sets which is closed under union, concatenation, and Kleene closure as discussed by the authors, and it is shown that any finite set can be easily generated by a regular grammar.
read more
Abstract: Now recall the definition of regular sets and some of the characterization results for this class. In particular, we know that the class of regular sets is the smallest class of sets containing the finite sets which is closed under union, concatenation, and Kleene closure. Now note that any finite set can be very easily generated by a regular grammar. For example to generate the set {aa, ab} we use the grammar:
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Combinatorics, Automata and Number Theory
Valrie Berth,Michel Rigo +1 more
- 30 Sep 2010
TL;DR: In this article, the authors present recent trends arising from the fruitful interaction between the themes of combinatorics on words, automata and formal language theory, and number theory and reveal some of the exciting and important relationships that exist between these different fields.
Formal Approach to the Deployment of Distributed Robotic Teams
TL;DR: A computational framework for automatic synthesis of control and communication strategies for a robotic team from task specifications that are given as regular expressions about servicing requests in an environment by using a technique inspired by linear temporal logic model checking.
181
Descriptional and computational complexity of finite automata---A survey
Markus Holzer,Martin Kutrib +1 more
TL;DR: This paper tours a fragment of a vast literature documenting the importance of deterministic, nondeterministic, and alternating finite automata as an enormously valuable concept, and discusses developments relevant to infinite automata related problems like simulation of and by several types of finite Automata.
172
Monadic datalog and the expressive power of languages for web information extraction
Georg Gottlob,Christoph Koch +1 more
- 03 Jun 2002
TL;DR: It is believed that MSO has the right expressiveness required for Web information extraction and thus MSO is proposed as a yardstick for evaluating and comparing wrappers and is compared to other wrapping languages proposed in the literature.
Duality and Equational Theory of Regular Languages
Mai Gehrke,Serge Grigorieff,Jean-Eric Pin +2 more
- 07 Jul 2008
TL;DR: This paper presents a new result in the equational theory of regular languages, which emerged from lively discussions between the authors about Stone and Priestley duality, and shows for instance that any class ofregular languages defined by a fragment of logic closed under conjunctions and disjunctions admits an equational description.