Theory of Computation 1 min read
Proving Languages not to be Regular
The pumping lemma for regular languages
EXPLORE THE FIELD
Category: Theory of Computation.
Discover thoughtful articles, guides and ideas about this topic.
← Explore all topics Theory of Computation 3 min read
Designing Finite Automata from Regular Expression (Set 1)
In this article, we will see some popular regular expressions and how we can convert them to finite automata. · Even…
Theory of Computation 3 min read
Regular Sets
Any set that represents the value of the Regular Expression is called a Regular Set. Properties of Regular Sets Property 1. The…
Theory of Computation 4 min read
Moore and Mealy Machines
Finite automata may have outputs corresponding to each transition. There are two types of finite state machines that generate output…
Theory of Computation 2 min read
Regular Expressions
A Regular Expression can be recursively defined as follows − · ε is a Regular Expression indicates the language containing an empty string. (L (ε)…
Theory of Computation 3 min read
DFA Minimization
DFA Minimization using Myphill-Nerode Theorem Algorithm Input − DFA Output − Minimized DFA Step 1 − Draw a table for all pairs of…
Theory of Computation 2 min read
NDFA to DFA Conversion
Problem Statement Let X = (Qx, ∑, δx, q0, Fx) be an NDFA which accepts the language L(X). We have to design…
Theory of Computation 4 min read
Non-deterministic Finite Automaton
In NDFA, for a particular input symbol, the machine can move to any combination of the states in the machine.…
Theory of Computation 3 min read
Automata Theory
Automata – What is it? The term “Automata” is derived from the Greek word “αὐτόματα” which means “self-acting”. An automaton…