PDA
#representation of non-regular language.#extra data structure stack is added to keep the list of the top-most alphabet.Symbols are kept in LIFO(Last In First Out) manner.
#It can remember infinite amount of informattion.
#has triplet structure(states, alphabets, stack-symbol)
Context-free languages are closed under
*union*concatenation
*closure & +closure
*homomorphism
*Reversal
Closure properties of Regular Language
# Union# Intersection
# Concatenation
# Complement
# Difference
# Closure
# Reversal
# Homomorphism
# Inverse Homomorphism
No comments:
Post a Comment