Question
1. Use the pumping lemma for regular languages to prove L is not regular where L = {1^r | r is a prime number}. 2.
1. Use the pumping lemma for regular languages to prove L is not regular where L = {1^r | r is a prime number}.
2. Use the pumping lemma for CFG to show L = {1^r | r is a prime number} above is not a CFL. (This also implies the answer to problem 1, but do problem 1 anyhow.)
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Lncs 8999 Databases In Networked Information Systems 10th International Workshop Dnis 2015 Aizu Wakamatsu Japan March 23 25 2015 Proceedings
Authors: Wanming Chu ,Shinji Kikuchi ,Subhash Bhalla
2015th Edition
3319163124, 978-3319163123
