Regular languages

Regular languages

Introduction

Published in John N. Mordeson, Davender S. Malik, Fuzzy Automata and Languages, 2002

In this section and Section 1.10, we show that regular grammars and finite-state automata are essentially the same in that either is a specification of a regular language. We next illustrate how a finite-state automaton can be converted to a regular grammar.

Most-intersection of countable sets

View Article

Journal Information

Published in Journal of Applied Non-Classical Logics, 2021

Ahmet Çevik, Selçuk Topal

Regular expressions and finite automata are equivalent forms of describing regular languages. That is, a language is regular if and only if there exists a finite automaton that recognises it if and only if there exists a regular expression that generates it. Note that regular languages are closed under finite unions. That is, given any two regular languages and , is a regular language. However, infinite union of regular languages may not be regular.2. To see this, for each , let . Now each is a regular language but is it a known fact that is not a regular language. Similar argument can be used to show that regular languages are closed under finite intersections but not under infinite intersections.

Explore chapters and articles related to this topic

Introduction

Most-intersection of countable sets