## Decidability Table in Theory of Computation

Prerequisite – Undecidability, Decidable and undecidable problems Identifying languages (or problems*) as decidable, undecidable or partially decidable is a very common question in GATE. With… Read More »

## Finite Automata with Output (Set 5)

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 »

## Finite Automata with Output (Set 6)

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 »

## Automata Theory | Set 8

These questions for practice purpose for GATE CS Exam. Ques-1: Which one of the following language is Regular? (A) {wxwR | w,x ∈ (a+b)+} (B)… Read More »

## Dynamic Frequency Scaling and Dynamic Voltage Scaling

‘Frequency’ in this context refers to the clock frequency or the frequency of operation of a CPU. So the term Dynamic Frequency Scaling refers to… Read More »

## NLP | Chunk Tree to Text and Chaining Chunk Transformation

We can convert a tree or subtree back to a sentence or chunk string. To understand how to do it – the code below uses… Read More »

## Python | Maximum Sum Sublist

We can have an application for finding the lists with the maximum value and print it. This seems quite an easy task and may also… Read More »

## Python | Delete elements in range

The deletion of a single element comparatively easier, but when we wish to delete element in range, the task becomes a tedious once due to… Read More »

## NLP | Named Entity Chunker Training

Self Named entity chunker can be trained using the ieer corpus, which stands for Information Extraction: Entity Recognition. The ieer corpus has chunk trees but… Read More »

## jQuery | Traversing Filtering

The traversing filtering in jQuery is used to find HTML elements based on their relation to the other elements. Filtering is the process in jQuery… Read More »

## NLP | Creating Shallow Tree

Prerequisite: Flattening Deep Tree We have flattened a Deep Tree by only keeping the lowest level subtrees. But here we can keep the highest level… Read More »

## NLP | Flattening Deep Tree

Some of the corpora that we use are often deep trees of nested phrases. But working on such deep trees is a tedious job for… Read More »

## NLP | Singularizing Plural Nouns and Swapping Infinite Phrases

Let’s understand this with an example : Is our child training enough? Is are our child training enough? The verb ‘is’ can only be used… Read More »

## NLP | Swapping Verb Phrases and Noun Cardinals

Need to swap verb phrases? To eliminate the passive voice from particular phrases. This normalization is helpful with frequency analysis, by counting two apparently different… Read More »

## NLP | Verb Forms Correction

Let’s understand this with an example : Is our child training enough? Is are our child training enough? The verb ‘is’ can only be used… Read More »