How to design Push Down Automata for the language that has equal number of as and b's where n>=1 I got how to do it for n>=O, not able to get i ...
How to design Push Down Automata for the language that has equal number of as and b's where n>=1 I got how to do it for n>=O, not able to get i ...
I am a part of a team of 5 developers that work with gathering data, transforming, analyzing and predicting data in Azure Databricks (basically a comb ...
There is this proof that I thought of that I am not quite sure if it's valid or not. Suppose you had to prove the nonregularity of the following lang ...
In our course of Theory of Computation, we have done the proof for closure of regular languages(L1, L2) under intersection, union and complement. But ...
How to construct unrestricted grammar that generates L = {a^ib^j c^k^d^l : i not equal to k AND j not equal to l}. a is to the power of i, 'b' raised ...
(https://i.stack.imgur.com/lU278.png) Why option C is also not correct? ...
I am currently enrolled in the undergraduate version of Theory of Computation at my university and we are discussing Pushdown Automata, Turing Machine ...
Given that the C++ template system is not context-free and it's also Turing-Complete, can anyone provide me a non-trivial example of a program that ma ...
Example input: 010101, output: 000 Example input: 10011, output: 101 Example input: 11101101, output: 1110 While drawing a state diagram for ...
During an NP hard problem's complexity analysis, I am stuck at this term. $O(2^{o(n)})$ In particular: O(2^{n-o(n)})+O(2^{o(n)}) I ended ...
S→aAa | bBb |€, A→C|a , B→C|b , C→CDE | € , D→A|B|ab In this i think E,C,D are useless but if we remove those, then there is no point in this questio ...
Problem from page 5 of this pdf. Give an NFA that recognizing the language (01 U 001 U 010)* I think this is wrong because there should be an addit ...
This is my implementation of the inversion counting algorithm using a divide and conquer approach, the problem i am having is it keeps saying there is ...
Let us say we have an algorithm with multiple steps and each of those steps can be parallelized. Given a certain number of CPU cores, is there a mathe ...
[I'm on new grounds here, there might be some ambiguities] Consider the recursor (which is a generalization of primitive recursion over higher types) ...
I have a vague understanding of undecidability. I get it that undecidability is that for a problem there exists no algorithm or the Turing machine wil ...
I am a beginner. What's so special about Turing and Von Neumann models? Are they art or science? Are they akin to the fundamental laws of natu ...
I am little confused about either can we make pda for a^n b^n+1 language ? As to my knowledge pda can be made only for CFL. Does a^n b^n+1 is cfl or n ...
Is it possible to write a program that determines the worst case running time of an algorithm in big-O notation? One that would, for example, be able ...
I think it's true because you can reduce B to A and then run the probabilistic algorithm of A and if we got a reject then it's also a reject for B and ...