Categories
Tags
Finite-automata
New post in Finite-automata
Final state of a Finite automaton.
August 1st, 2022
finite-automata
formal-languages
Which of the following sets are regular and which are not? Give justification.
February 20th, 2020
finite-automata
regular-expressions
Prove that $even(L)$ is regular
August 1st, 2022
regular-language
finite-automata
automata
Table-filling method for DFA minimization with non-binary alphabet
September 8th, 2020
finite-automata
Finite language proof involving finite automata
February 7th, 2020
formal-languages
proof-verification
proof-writing
finite-automata
Give a context-free grammar that generates the language
May 13th, 2020
finite-automata
context-free-grammar
automata
DFA - Union operation: How to?
August 1st, 2022
regular-language
logic
automata
finite-automata
how to reduce DFA to NFA with less states
September 9th, 2020
finite-automata
formal-languages
regular-expressions
regular-language
automata
Show there is a string that's length is less than or equal to the number of states in an NFA
August 1st, 2022
automata
formal-languages
finite-automata
Regular expression for language containing all strings that start and end with different symbols
August 1st, 2022
automata
regular-expressions
finite-automata
How can I prove that "non-palindromes starting with 010" is not a regular language?
August 1st, 2022
regular-language
finite-automata
Proof Correctness, are the following NFA's correct?
February 8th, 2020
finite-automata
computer-science
proof-verification
Is the language $L$ generated by 'Fibonacci Strings' (as given in the desciption) regular? If not, disprove by Pumping Lemma
September 2nd, 2020
automata
finite-automata
How do I construct transition table for the following?
November 23rd, 2020
automata
finite-automata
Convert NFA to DFA
March 25th, 2020
automata
finite-automata
computability
Convert the regular expression to a NFA
April 21st, 2020
automata
computability
regular-language
regular-expressions
finite-automata
Context free grammar to NFA
August 1st, 2022
automata
formal-languages
context-free-grammar
finite-automata
Number of finite-state machines with $n$ states, output alphabet size $a$, and binary input
June 9th, 2020
turing-machines
combinatorics
automata
finite-automata
graph-theory
Union of two Non deterministic Finite automata
February 1st, 2021
automata
finite-automata
Describing the language generated by this grammar
January 1st, 2020
regular-language
finite-automata
Constructing a NFA for the following language
June 21st, 2021
regular-language
computer-science
automata
finite-automata
Transition function of a NFA
August 1st, 2022
finite-automata
Example of language that does not contain substring $11$
July 19th, 2020
formal-languages
regular-expressions
regular-language
automata
finite-automata
Isn't $L=\{ww|w \in \{0,1\}^*\}$ a Non Deterministic Context Free Language?
May 20th, 2021
regular-expressions
finite-automata
context-free-grammar
Divisibility problem using DFA
May 6th, 2020
automata
divisibility
finite-automata
Give a language L over alphabet $\{0,1\}$ such that the following criteria are met:
August 2nd, 2020
regular-expressions
regular-language
automata
finite-automata
Minimum number of states of a DFA recognizing the regular expression $(a+b)^*b(a+b)$
August 1st, 2022
regular-expressions
automata
discrete-mathematics
finite-automata
regular-language
Induction Proof on String
May 3rd, 2020
finite-automata
induction
Show that A/B is regular.
April 7th, 2022
finite-automata
automata
DFA that accepts strings where there are odd number of 1's, and any number of 0's
July 22nd, 2020
regular-expressions
automata
finite-automata
regular-language
←
1
2
→