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 (ε)…
THE ARTICLE LIBRARY
All stories.
Ideas and explainers from across SenseCentral.
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.…
Software Testing 2 min read
Deterministic Finite Automaton
Finite Automaton can be classified into two types − Deterministic Finite Automaton (DFA) Non-deterministic Finite Automaton (NDFA / NFA) Deterministic…
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…
Software Testing 2 min read
Software Testing – Estimation Techniques
Estimating the efforts required for testing is one of the major and important tasks in SDLC. Correct estimation helps in…
Software Testing 4 min read
Software Testing – Documentation
Testing documentation involves the documentation of artifacts that should be developed before or during the testing of Software. Documentation for software testing…
Software Testing 11 min read
Software Testing – Levels
There are different levels during the process of testing. In this chapter, a brief description is provided about these levels.…
Software Testing 5 min read
Software Testing – Methods
There are different methods that can be used for software testing. This chapter briefly describes the methods available. Black-Box Testing …