Questions about computation-theory
Read more about computation-theory
python (65.1k questions)
javascript (44.2k questions)
reactjs (22.7k questions)
java (20.8k questions)
c# (17.4k questions)
html (16.3k questions)
r (13.7k questions)
android (12.9k questions)
why a^m b^n where m,n > 0 is a regular language but a^n b^n where n > 0 is non regular language
a^m b^n where m,n >= 0 is a regular language but why a^n b^n where n >= 0 is a non-regular language?
In both languages, we are taking an infinite number of a's and b's but why we could build a F...
Priyansh Srivastava
Votes: 0
Answers: 3
How to change The Ring of the polynomial in Julia
Main
using AbstractAlgebra
include("./lib.jl");
S, (a,b,c) = PolynomialRing(QQ,["a","b","c"])
RR = AbstractAlgebra.RealField
s1 = S(b^2*a + c*a - 1)
s2 = S(c*a...
Ahmet Yusuf
Votes: 0
Answers: 0
Front-End and Back-End calculating different amounts? Should the calculation be done in the same place?
So I have this issue with a website that I work on.
It goes like so (note: This is not exactly what happens. I am just painting a picture):
Front-End:
User has a cart full of things they want to buy
...
Slaknation
Votes: 0
Answers: 2
Is the following language decidable? L = {<M> : M(x) is a Turing machine with running time bounded by 100|x|^2 + 200}
L = {<M> : M(x) is a Turing machine with running time bounded by 100|x|^2 + 200}
I think L is undecidable but I can't solve that. Please help me prove it. Thanks!
Wang
Votes: 0
Answers: 1