Decision problems of regular languages, We'll close our consideration of re...

We'll close our consideration of regular languages by looking at whether (certain) problems about regular languages are algorithmically decidable.

Discrete math, Find the Regular Grammar for the following Regular Expressio...

Find the Regular Grammar for the following Regular Expression: a(a+b)*(ab*+ba*)b.

#turing machine, #can you solve a problem of palindrome using turing machin...

#can you solve a problem of palindrome using turing machine with explanation and diagrams?

Complement - operations on languages, The fact that SL 2 is closed under i...

The fact that SL 2 is closed under intersection but not under union implies that it is not closed under complement since, by DeMorgan's Theorem L 1 ∩ L 2 = We know that

Dfa to re, c program to convert dfa to re

c program to convert dfa to re

Suffix substitution , Exercise Show, using Suffix Substitution Closure, tha...

Exercise Show, using Suffix Substitution Closure, that L 3 .
L 3 ∈ SL 2 . Explain how it can be the case that L 3
. L 3 ∈ SL 2 , while L 3 .
L 3 ⊆ L + 3 and L + 3 ∈ SL

Arden''s theorem,

Chomsky normal form, s-> AACD A-> aAb/e C->aC/a D-> aDa/bDb/e

s-> AACD A-> aAb/e C->aC/a D-> aDa/bDb/e

Normal forms, how to convert a grammar into GNF

how to convert a grammar into GNF

Arden''s theoram, proof of arden''s theoram

proof of arden''s theoram