한국어
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
전체 기사
카테고리
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
당신은 쓰기
사용자
로그인
등록
비밀번호 복구
태그
언어 태그
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
태그 formal-languages - 이것은 페이지 236 페이지입니다 - GeneraCodice
Determining capabilities of a min-heap (or other exotic) state machines
https://www.generacodice.com/ko/articolo/1091194/determining-capabilities-of-a-min-heap-or-other-exotic-state-machines
automata
-
formal-languages
cs.stackexchange
What are the conditions for a NFA for its equivalent DFA to be maximal in size?
https://www.generacodice.com/ko/articolo/1091231/what-are-the-conditions-for-a-nfa-for-its-equivalent-dfa-to-be-maximal-in-size
finite-automata
-
automata
-
formal-languages
-
regular-languages
-
nondeterminism
cs.stackexchange
A sufficient and necessary condition about regularity of a language
https://www.generacodice.com/ko/articolo/1091294/a-sufficient-and-necessary-condition-about-regularity-of-a-language
formal-languages
-
regular-languages
cs.stackexchange
What are the possible sets of word lengths in a regular language?
https://www.generacodice.com/ko/articolo/1091307/what-are-the-possible-sets-of-word-lengths-in-a-regular-language
computability
-
finite-automata
-
formal-languages
-
regular-languages
cs.stackexchange
Is there a “natural” undecidable language?
https://www.generacodice.com/ko/articolo/1091335/is-there-a-natural-undecidable-language
computability
-
automata
-
formal-languages
-
undecidability
cs.stackexchange
Is an infinite union of context-free languages always context-free?
https://www.generacodice.com/ko/articolo/1091390/is-an-infinite-union-of-context-free-languages-always-context-free
formal-languages
-
context-free
-
closure-properties
cs.stackexchange
Parsing arbitrary context-free grammars, mostly short snippets
https://www.generacodice.com/ko/articolo/1091456/parsing-arbitrary-context-free-grammars-mostly-short-snippets
formal-languages
-
parsers
-
compilers
cs.stackexchange
How to prove that a language is not context-free?
https://www.generacodice.com/ko/articolo/1091521/how-to-prove-that-a-language-is-not-context-free
formal-languages
-
reference-question
-
context-free
-
proof-techniques
cs.stackexchange
Decidable non-context-sensitive languages
https://www.generacodice.com/ko/articolo/1091540/decidable-non-context-sensitive-languages
complexity-theory
-
formal-languages
-
formal-grammars
cs.stackexchange
Show that { xy ∣ |x| = |y|, x ≠ y } is context-free
https://www.generacodice.com/ko/articolo/1091598/show-that-xy-x-y-x-y-is-context-free
formal-languages
-
context-free
cs.stackexchange
«
233
234
235
236
237
238
»
결과가 발견되었습니다: 2380