This document outlines 9 problems related to theory of computation. It asks the reader to: 1) Design Turing machines for various languages; 2) Determine complexity classes for other languages; 3) Prove undecidability of determining equivalence of context-free grammars; 4) Determine recursively enumerability of languages; 5) Prove decidability of the Post Correspondence Problem over a 1-letter alphabet; 6) Show a generalized game of Go-Moku is in PSPACE; 7) Show satisfiability of formulas in conjunctive normal form (SAT) is NP-Complete; 8) Prove properties of 2-SAT and 3-SAT problems; 9) Show a solitaire game problem is NP
FellowBuddy.com is an innovative platform that brings students together to share notes, exam papers, study guides, project reports and presentation for upcoming exams.
We connect Students who have an understanding of course material with Students who need help.
Benefits:-
# Students can catch up on notes they missed because of an absence.
# Underachievers can find peer developed notes that break down lecture and study material in a way that they can understand
# Students can earn better grades, save time and study effectively
Our Vision & Mission – Simplifying Students Life
Our Belief – “The great breakthrough in your life comes when you realize it, that you can learn anything you need to learn; to accomplish any goal that you have set for yourself. This means there are no limits on what you can be, have or do.”
Like Us - https://www.facebook.com/FellowBuddycom
FellowBuddy.com is an innovative platform that brings students together to share notes, exam papers, study guides, project reports and presentation for upcoming exams.
We connect Students who have an understanding of course material with Students who need help.
Benefits:-
# Students can catch up on notes they missed because of an absence.
# Underachievers can find peer developed notes that break down lecture and study material in a way that they can understand
# Students can earn better grades, save time and study effectively
Our Vision & Mission – Simplifying Students Life
Our Belief – “The great breakthrough in your life comes when you realize it, that you can learn anything you need to learn; to accomplish any goal that you have set for yourself. This means there are no limits on what you can be, have or do.”
Like Us - https://www.facebook.com/FellowBuddycom
es un modelo de planeamiento para estudiante con discapacidad para un aprendizajes significativo y obtener un mejor proceso de enseñanza aprendizajes en estudiantes con necesidades educativas especiales
es un modelo que nos ofrece una vista de como trabajar estos estudiantes es modelo me parece muy sustancial ya que muestra la prueba para realizar
Le panorama des sites gravitant autour du vôtre, par connexion hypertexte : liens retour, ainsi qu'éléments de notation (scores SEO) et des éléments sémantiques (ancres de liens).
Facteur historique de référencement Google, le profil de liens peut s'améliorer par des travaux SEO que nous réalisons pour vous.
I am Elijah L. I am an Algorithm Assignment Expert at programminghomeworkhelp.com. I hold a Bachelor’s Degree in Programming, Leeds University, UK. I have been helping students with their homework for the past 6 years. I solve assignments related to Algorithms.
Visit programminghomeworkhelp.com or email support@programminghomeworkhelp.com.You can also call on +1 678 648 4277 for any assistance with Algorithm assignments.
I am Justin M. I am an Algorithm Exam Expert at programmingexamhelp.com. I hold a Bachelor of software engineering from, the University of Massachusetts Amherst, United States. I have been helping students with their exams for the past 9 years. You can hire me to take your exam in Algorithm.
Visit programmingexamhelp.com or email support@programmingexamhelp.com. You can also call on +1 678 648 4277 for any assistance with the Algorithm Exam.
A Quest for Subexponential Time Parameterized Algorithms for Planar-k-Path: F...cseiitgn
The field of designing subexponential time parameterized algorithms has gained a lot of momentum lately. While the subexponential time algorithm for Planar-k-Path (finding a path of length at least k on planar graphs) has been known for last 15 years. There was no such algorithms known on directed planar graphs. In this talk, I will survey this journey of designing subexponential time parameterized algorithms for finding a path of length at least k in planar undirected graphs to planar directed graphs; highlighting the new tools and techniques that got developed on the way.
I am Andrew O. I am an Algorithm Assignment Expert at programminghomeworkhelp.com. I hold a master’s in Programming from, the University of Southampton, UK. I have been helping students with their assignments for the past 12 years. I solve assignment related to Algorithms.
Visit programminghomeworkhelp.com or email support@programminghomeworkhelp.com. You can also call on +1 678 648 4277 for any assistance with the Algorithm assignment.
NP completeness. Classes P and NP are two frequently studied classes of problems in computer science. Class P is the set of all problems that can be solved by a deterministic Turing machine in polynomial time.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Democratizing Fuzzing at Scale by Abhishek Aryaabh.arya
Presented at NUS: Fuzzing and Software Security Summer School 2024
This keynote talks about the democratization of fuzzing at scale, highlighting the collaboration between open source communities, academia, and industry to advance the field of fuzzing. It delves into the history of fuzzing, the development of scalable fuzzing platforms, and the empowerment of community-driven research. The talk will further discuss recent advancements leveraging AI/ML and offer insights into the future evolution of the fuzzing landscape.
Water scarcity is the lack of fresh water resources to meet the standard water demand. There are two type of water scarcity. One is physical. The other is economic water scarcity.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Quality defects in TMT Bars, Possible causes and Potential Solutions.PrashantGoswami42
Maintaining high-quality standards in the production of TMT bars is crucial for ensuring structural integrity in construction. Addressing common defects through careful monitoring, standardized processes, and advanced technology can significantly improve the quality of TMT bars. Continuous training and adherence to quality control measures will also play a pivotal role in minimizing these defects.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Design and Analysis of Algorithms-DP,Backtracking,Graphs,B&B
Problem set3 | Theory of Computation | Akash Anand | MTH 401A | IIT Kanpur
1. Department of Mathematics and Statistics, I.I.T. Kanpur
MTH401 Theory of Computation - Problem Set 3
(1) Design a Turing machine for each language listed below. Note that you may choose
not to provide official details (e.g., the transition diagram, etc.) of your machine
but in that case you must clearly explain what constitutes your machine (e.g.,
alphabet/symbols, tapes/tracks, etc) along with how your machine works (e.g., a
step by step description of the working of your Turing machine).
(a) {0n
1n2
: n > 0}.
(b) The language of odd integers written in binary.
(c) {a#b#c : a, b, c ∈ {0, 1}+
and val(a) + val(b) = val(c)}. (Note that val(α) is
defined to be the non-negative integer that has binary representation α)
(2) For each of the language below, indicate the smallest complexity class that contains
it (e.g., Regular, Deterministic Context Free, Context Free, Recursive, Recursively
Enumerable, Not Recursively Enumerable). You should provide sufficient justifica-
tions for your judgments.
(a) {1n
0m
1m
0n
: n, m > 0}.
(b) The language L of all strings α over {a, b, c} such that α contain an equal
number of occurrences of a’s, b’s and c’s.
(c) The complement of the language L in part (b).
(d) {0m
: m = 2k + 1 where k > 0}.
(e) {0m
10m!
: m > 0}.
(3) Prove that the problem of determining if the languages generated by two CFG’s
are equal is undecidable.
(4) For each of the following languages, state whether the language is or is not re-
cursively enumerable and whether the complement of the language is or is not
recursively enumerable. Justify for your answers.
(a) {M : M is a Turing machine with L(M) = ∅}.
(b) {M : M is a Turing machine with L(M) = Σ∗
}.
(c) {M : M is a Turing machine where L(M) is a regular set}.
(d) {M : M is a finite state machine with L(M) = Σ∗
}.
(e) {G : G is an ambiguous context free grammar }.
1
2. 2
(5) Prove that the Post Correspondence Problem is decidable for strings over the al-
phabet {0}.
(6) The Japanese game go-moku is played by two players, “X” and “O”, on a 19 × 19
grid. Players take turns placing markers, and the first player to achieve 5 of his
markers consecutively in a row, column, or diagonal, is the winner. Consider this
game generalized to an n by n board. Let
GM = {P : P is a position in generalized go-moku
where player “X” has a winning strategy}.
A position means a board with markers on it , such as ones that may occur in the
middle of a play of the game. Show that GM is in PSPACE.
(7) (a) A literal is either a variable or the negation of a variable.
(b) A clause is an OR of literals.
(c) A Boolean formula is in Conjunctive Normal Form (CNF) if it the AND
of clauses.
(d) The problem CSAT refers to the yes/no question “Is a Boolean formula in
CNF satisfiable?”
Show that CSAT is NP-Complete.
Hint : One can easily modify the proof of Cook’s theorem to product a Boolean
expression in CNF.
(8) If a Boolean expression is in CNF and every clause consists of exactly k literals, we
say that the Boolean formula is in k-CNF and its satisfiability question an instance
of k-SAT.
(a) Prove that 2-SAT is in P.
(b) Show that 3-SAT is NP-complete.
(9) Consider the following solitaire game. You are given an m × m board where each
one of the m2
positions may be empty or occupied by either a red stone or a blue
stone. Initially, some configuration of stones is placed on the board. Then, for each
column you must remove either all of the red stones in that column or all of the blue
stones in that column. (If a column already has only red stones or only blue stones
in it then you do not have to remove any further stones from that column.) The
objective is to leave at least one stone in each row. Finding a solution that achieves
this objective may or may not be possible depending upon the initial configuration.
3. 3
Let
SOLITAIRE = {G : G is a game configuration with a solution}.
Prove that SOLITAIRE is NP-complete.
Hint : Show that 3-SAT ≤P SOLITAIRE.