## Variation of Turing Machine

Prerequisite – Turing Machine 1. Multiple track Turing Machine: A k-tack Turing machine(for some k>0) has k-tracks and one R/W head that reads and writes… Read More »

- Program for Gauss Siedel Method (Computational Mathematics)
- Construct a DFA which accept the language L = {w | w ∈ {a,b}* and Na(w) mod 3 = Nb (w) mod 3}
- Regular Expression Vs Context Free Grammar
- Multitape Nondeterministic Turing Machine simulator
- NPDA for accepting the language L = {wwR | w ∈ (a,b)*}
- Construct a DFA which accept the language L = {a
^{n}b^{m}| n > =1, (m) mod 3 = 1} - NFA machines accepting all strings that ends or not ends with substring 'ab'
- Construct DFA which interpreted as binary number is divisible by 2, 3, 4
- Compound Finite Automata (FA)
- Modifications to standard Turing Machine
- DFA (Recognizer) for valid Pascal identifiers
- Variation of Turing Machine

Prerequisite – Turing Machine 1. Multiple track Turing Machine: A k-tack Turing machine(for some k>0) has k-tracks and one R/W head that reads and writes… Read More »

Problem – Implement a recognizer for pascal identifiers based on a DFA that accepts strings belonging to the definition of the language of the same.… Read More »

This article tackles both theoretical and practical issues in Computer Science (CS). It reviews Turing Machines (TMs), a fundamental class of automata and presents a… Read More »

Prerequisite: Finite Automata Introduction Problem-1: Construction of a minimal NFA accepting a set of strings over {a, b} in which each string of the language… Read More »

Problem: Construct a deterministic finite automata (DFA) for accepting the language L = {w | w ∈ {a,b}* and Na(w) mod 3 = Nb (w)… Read More »

Problem: Construct a DFA which accept the language L = {anbm | n > =1, (m) mod 3 = 1}. Explanation: For constructing the DFA,… Read More »

Prerequisite – Pushdown Automata, Pushdown Automata Acceptance by Final State Problem: Design a non deterministic PDA for accepting the language L = {wwR w ∈… Read More »

The Gauss Seidel method is an iterative process to solve a square system of (multiple) linear equations. It is also prominently known as ‘Liebmann’ method.… Read More »

Prerequisite: Finite Automata Introduction, Designing Finite Automata Problem-1: Construct DFA, which accepts set of all strings over {0, 1} which interpreted as binary number is… Read More »

Prerequisite – Finite Automata (FA) Compound FA is the resultant DFA formed after performing operation (∪, ∩, -) on given DFAs D1 and D2. D1… Read More »

A standard Turing Machine is a machine which on providing an input moves either to the left or right and it may overwrite the existing… Read More »

Regular Expressions are capable of describing the syntax of Tokens. Any syntactic construct that can be described by Regular Expression can also be described by… Read More »

Prerequisite: Mealy and Moore Machines, Difference between Mealy machine and Moore machine In this article, we will see some designing of Finite Automata with Output… Read More »

Prerequisite – Finite Automata Introduction, Designing Finite Automata from Regular Expression (Set 1) ∈-NFA is similar to the NFA but have minor difference by epsilon… Read More »

Prerequisite: Finite automata, Regular expressions, grammar and language, Designing finite automata from Regular expression (Set 7) In the below article, we shall see some Designing… Read More »