# Tag: automata theory languages and computation tutorial

### Regular expression in theory of computation solved examples Part 4

Find the regular expression for the set of strings with either no '1' preceding a '0' or no '0' preceding a '1', over {0,...

### Regular expression examples in theory of automata Part – 3

Find out the regular expression for the set of strings of a's, b's and c's (aaa, aab, .. .. .. .., ccc).
Solution: We have the...

### Regular expression in theory of computation solved examples Part – 2

This is 2nd Part of Regular expression in theory of computation solved examples. You can also read Regular expression in theory of computation solved examples...

### Regular expression in theory of computation solved examples

Determine the regular expression for all strings containing exactly one 'a' over ∑ = {a, b, c}.
Solution: We have the input alphabets are ∑ =...

### Pushdown automata Instantaneous Description

Instantaneous Description (ID) is an informal notation of how a PDA "computes" a input string and make a decision that string is accepted or...

### Pushdown automata Representation with solved examples

Representation of Pushdown automata:
The pushdown automaton is represented by the following types;
1. Transaction function of pushdown automata:
2. Graphical Notation of pushdown automata (PDA): Transaction functions...

### Pushdown Automata Operation : Push and Pop with example

In Pushdown automata the stack head always scans the top symbol of the stack. It performs two basic operations. Push Operations: Push operations add a...

### Pushdown automata Definition: Formal and Informal

Pushdown Automata Informal Definition:
The pushdown automaton is in essence a nondeterministic finite automata with ε-moves permitted and one additional stack capability on which it can...

### Push Down Automata (PDA) Introduction and Requirement

The description of Context-Free Languages (CFL) by means of context-free grammars is convenient, as illustrated by the use of BNF (Baucus Normal Form) in...

### Ambiguous Grammar definition and solved examples

Ambiguous Grammar / Ambiguous Languages:
A CFG is said to be ambiguous if and only if it contains more than one derivation trees for same...