## Introduction to Queue Automata

We already know about Finite Automata which can be used to accept regular languages and Pushdown Automata that can be used to recognize Context Free… Read More »

- Closure properties of Regular languages
- Conversion of Epsilon-NFA to NFA
- Difference between DFA and NFA
- Program to build a DFA to accept strings that start and end with same character
- Build a DFA to accept Binary strings that starts or ends with "01"
- Various Properties of context free languages (CFL)
- Design a mealy machine for 2's complement
- NFA to accept strings that has atleast one character occurring in a multiple of 3
- Church’s Thesis for Turing Machine
- Program to build a DFA that accepts strings starting and ending with different character
- Turing Machine to check whether given string is Even Palindrome or not
- Mealy Machine for 1's Complement
- Find all compatable and non compatable edges of a machine
- DFA for exactly one of a and at least one of b
- Design a DFA that every 00 is immediately followed by 1
- Construct a Turing Machine for language L = {a^n b^m c^nm where n >=0 and m >= 0}
- Optimizing state table of a completely specified machine
- Construct a Turing Machine for language L = {0
^{2n}1^{n}| n>=0} - Proof that Path Selection Decision problem is NP-Complete

We already know about Finite Automata which can be used to accept regular languages and Pushdown Automata that can be used to recognize Context Free… Read More »

Finite Automata is known to finite state machine which works with transition from one state to another on every input alphabet, as per the defined… Read More »

Prerequisite – Clique is NP A Polynomial-time reduction is a method for solving one problem using another. E-TM = {<M> : M is a TM… Read More »

Prerequisite: Introduction to Deterministic Finite Automata Construct a DFA that accepts a string str starting with input alphabet ‘a’ but does not contain ‘aab’ as… Read More »

Prerequisite – Design a Finite automta Let’s understand the intersection of two DFA with an example. Designing a DFA for the set of string over… Read More »

Post Correspondence Problem is a popular undecidable problem that was introduced by Emil Leon Post in 1946. It is simpler than Halting Problem. In this… Read More »

Problem Statement: Design a Definite Finite Automata for accepting the permutation of Three a’s and Three b’s over the input {a, b} Input: S =… Read More »

Given a binary string str, the task is to build a DFA that accepts given binary string if it contains “01” i times and “1”… Read More »

Prerequisite – Converting Context Free Grammar to Chomsky Normal Form CYK algorithm is a parsing algorithm for context free grammar. In order to apply CYK… Read More »

Prerequisite – NP-Completeness The decision problem of path selection problem asks if it is possible to select at least k paths from the given paths… Read More »

Given a binary string str, the task is to build a DFA that accepts the string if the string either starts with “01” or ends… Read More »

Prerequisite – Turing Machine The language L = {anbmcnm | n >= 0 and m>=0} represents a kind of language where we use only 3… Read More »

Prerequisite – Turing Machine The language L = {02n1n | n >= 0} represents a kind of language where we use only 2 symbols, i.e.,… Read More »

Deterministic Finite Automata (DFA) is defined as an abstract mathematical concept which is used to solve various specific problems in different software and hardware.In this… Read More »

In 1936, A method named as lambda-calculus was created by Alonzo Church in which the Church numerals are well defined, i.e. the encoding of natural… Read More »