Fancy Hints

  • Home
  • Blog
  • Coding
    • .Net
    • Csharp
    • iOS
    • CSS
    • Python
    • Java
    • Node.js
    • jquery
    • Javascript
    • Android
    • PHP
  • Tech
    • Systems
    • Digital
    • Computer Science
    • Security
    • Hosting
    • Website
    • Mobile
  • Donate

Tag: automata

Computer Science

Automata Greibach Normal Form

Greibach Normal Form In Greibach Normal Form, there is restriction on the position, in which, terminals and variables can appear on right-hand side of production rules. In Greibach Normal Form, every production must start with a single terminal Read more…

By Umar Khan, 4 years ago January 4, 2021
Computer Science

Converting Finite Automata to Regular Expression using Arden’s Theorem

Converting Finite Automata to Regular Expression using Arden’s Theorem The Arden’s Theorem can be applied to find the regular expression recognized by the given transition diagram. This theorem can be applied to transition diagram not containing ε-moves or ε-transitions. Let’s Read more…

By Umar Khan, 4 years ago January 4, 2021
Computer Science

Simplification of Context Free Grammar – Automata

Simplification of Context Free Grammar Context Free Grammar has recursive structure. The languages that are accepted with Context Free Grammar are called Context Free Languages. Context Free Grammar has one condition for production rules, i.e., on the left-hand Read more…

By Umar Khan, 4 years ago January 3, 2021
Computer Science

Chomsky’s Normal Form – Automata

Chomsky’s Normal Form (CNF) In context free grammar, the left-hand side of production rules contains only one variable, and right side may contain any number of variables or terminals in production rule. The production rules Read more…

By Umar Khan, 4 years ago December 30, 2020
Computer Science

Context Free Grammar -Automata

Context Free Grammar Grammar defines a set of rules, and with the help of these rules valid sentences in a language are constructed. A grammar consists of collection of substitution rules, which are also called production rules. Read more…

By Umar Khan, 4 years ago December 30, 2020
Computer Science

Ambiguity in Context Free Grammar -Automata

Ambiguity in Context Free Grammar? Context Free Grammar Context Free Grammar has one condition for production rules, which is, on the left-hand side of each rule, there must be only single variable, and on the right-hand Read more…

By Umar Khan, 4 years ago December 30, 2020
Computer Science

Derivation Tree of Context Free Grammar -Automata

Derivation Tree of Context Free Grammar Derivation tree gives a way to show how a string can be derived from context free grammar. It is also called as parse tree, production tree, and syntax tree. The interior nodes of derivation tree Read more…

By Umar Khan, 4 years ago December 30, 2020
Computer Science

Pumping Lemma for Regular Languages -Automata

Pumping Lemma for Regular Languages The language accepted by the finite automata is called Regular Language. If we are given a language L and asked whether it is regular or not? So, to prove a given Language L Read more…

By Umar Khan, 4 years ago December 30, 2020
Computer Science

Closure Properties of Regular Languages -Automata

Closure Properties of Regular Languages We use the term “Closure” when we talk about sets of things. If we have two regular languages L1 and L2, and L is obtained by applying certain operations on L1, Read more…

By Umar Khan, 4 years ago December 30, 2020
Computer Science

Simplification of Context Free Grammar -Automata

Simplification of Context Free Grammar Context Free Grammar has recursive structure. The languages that are accepted with Context Free Grammar are called Context Free Languages. Context Free Grammar has one condition for production rules, i.e., on the left-hand Read more…

By Umar Khan, 4 years ago December 30, 2020
Recent Posts
  • Buffett won’t be annual meeting star next year
  • Popular fast-food chain closing down restaurants at alarming rate
  • How cruise ship captains keep you safe in bad weather
  • China begins assembling its supercomputer in space
  • China begins assembling its supercomputer in space
Recent Comments
    Archives
    • May 2025
    • April 2025
    • March 2025
    • February 2025
    • January 2025
    • December 2024
    • November 2024
    • October 2024
    • September 2024
    • August 2024
    • July 2024
    • June 2024
    • May 2024
    • April 2024
    • March 2024
    • February 2024
    • January 2024
    • December 2023
    • November 2023
    • October 2023
    • September 2023
    • August 2023
    • July 2023
    • June 2023
    • May 2023
    • April 2023
    • March 2023
    • February 2023
    • January 2023
    • December 2022
    • November 2022
    • October 2022
    • September 2022
    • August 2022
    • July 2022
    • June 2022
    • May 2022
    • April 2022
    • March 2022
    • February 2022
    • January 2022
    • December 2021
    • November 2021
    • October 2021
    • September 2021
    • August 2021
    • July 2021
    • June 2021
    • May 2021
    • April 2021
    • March 2021
    • February 2021
    • January 2021
    • December 2020
    • November 2020
    • October 2020
    • September 2020
    • June 2019
    • May 2019
    • July 2018
    • February 2018
    • January 2018
    • December 2017
    • November 2017
    Categories
    • .Net
    • Android
    • Architecture
    • BigData
    • c++
    • Cloud
    • COBOL
    • Coding
    • Computer Science
    • Cross-Platform
    • crypto
    • Cryptocurrencies
    • Csharp
    • CSS
    • Data science
    • digital
    • Email
    • English
    • Hosting
    • HTML
    • Investments
    • iOS
    • Java
    • Javascript
    • jquery
    • Machine Learning
    • Mobile
    • Node.js
    • PHP
    • Programming
    • Python
    • Security
    • SQL
    • Systems
    • Tech
    • Uncategorized
    • Web-services
    • Website
    • Home
    • Blog
    • Coding
    • Tech
    • Donate
    Hestia | Powered by WordPress