-
-
诟屍
@没有人 楼主认为不能修改输入,那肯定是不能 O(1) 实现的
下面回复的人认为可以先修改输入,之后再修改回来,所以认为楼主是错的
所以他们的讨论就是在瞎扯 233 -
-
诟屍
What is the connection of Turing-complete Language and Universal Turing Machine.
Anybody any idea?
Some discussion on stackexchange. -
-
诟屍
(期末了,该预习编译原理了2333)
Colloquially, we say that "finite automata cannot count," meaning that
a finite automaton cannot accept a language likethat would
require it to keep count of the number of a ' s before it sees the b's.
Likewise, "a grammar can count two items but not three," as we shall see when we consider non-context-free language constructs in Section 4.3.5.a grammar can not count three items:
a non-CFG: -