L₁ {abck i, j, k EN such that i < j and j > k} L₂ = { aibi+nck : i, j, k, n € N such that i + j < n+k} = For each language decide whether it is 1. Regular. 2. Not regular, but context-free. 3. Not context-free. If you answer "Regular" for a language, you must provide an FA (DFA, NFA, NFA+e) which accepts it or a regular expression which describes it. If you answer "Not regular, but context free", you must show that the language is not regular using any method/fact seen in class and provide either a CFG which generates it or a PDA (DPDA, NPDA) which accepts it. If you answer "Not context-free", you must provide a Pumping lemma proof. You do not need to prove the correctness of any of your constructions but you should explain how they work.

L₁ {abck i, j, k EN such that i < j and j > k} L₂ = { aibi+nck : i, j, k, n € N such that i + j < n+k} = For each language decide whether it is 1. Regular. 2. Not regular, but context-free. 3. Not context-free. If you answer "Regular" for a language, you must provide an FA (DFA, NFA, NFA+e) which accepts it or a regular expression which describes it. If you answer "Not regular, but context free", you must show that the language is not regular using any method/fact seen in class and provide either a CFG which generates it or a PDA (DPDA, NPDA) which accepts it. If you answer "Not context-free", you must provide a Pumping lemma proof. You do not need to prove the correctness of any of your constructions but you should explain how they work.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

d. L = {ww | the same string back to back, > = {a,b,c}} Prove that the given language is not context-free.
Write a regular expression for a language over alphabet L = {0, 1} accepting all strings start with 01 and ending with 10. Convert the given regular expression into NFA and then convert the NFA to DFA.
Find the regular expressions describing the following languages defined over the alphabet E = {0,1}: i. L, = {0*1" : n2 2, m z 1, n+m 2 4} ii. L, = {x : x| mod 3 = 0} i11. L; = {pqp : p,g E {0,1}* and | p |= 3}
Construct a DFA M for the language L={ωϵ{c,d} |ω has the most two c’s and atleast two d’s
Give the CFG of the following language over the alphabet {a, c, d}: The language contains the substring ccccExamples:dacdccccad, ccccda, adcccc, cdccccc
count a number of 1's in an orbitrary list of numbers . In a scheme language, please
Construct a Regular Expression for each of the following Languages over Alphabet set {a, b}. L1 = {w| all strings start and ended with same letter}
What is the FA corresponding to the language of strings, over alphabet {a, b}, that start with a and end with b or start with b and end with a.