Tag formal-languages - Это страница 1 - GeneraCodice

C and Turing Machines

https://www.generacodice.com/ru/articolo/13137895/c-and-turing-machines
  computer-science  -  turing-machines  -  formal-languages
StackOverflow StackOverflow

Why left most derevation is useful?

https://www.generacodice.com/ru/articolo/12788722/why-left-most-derevation-is-useful
  formal-languages
StackOverflow StackOverflow

When a keyword means different things in different contexts, is that an example of context sensitivity?

https://www.generacodice.com/ru/articolo/12583933/when-a-keyword-means-different-things-in-different-contexts-is-that-an-example-of-context-sensitivity
  scala  -  formal-languages  -  context-sensitive-grammar
StackOverflow StackOverflow

how to describe this regular expression in English

https://www.generacodice.com/ru/articolo/12459506/how-to-describe-this-regular-expression-in-english
  regex  -  formal-languages
StackOverflow StackOverflow

Non-contiguous text Capture with Regular Expressions. How can I do it?

https://www.generacodice.com/ru/articolo/12364115/non-contiguous-text-capture-with-regular-expressions-how-can-i-do-it
  java  -  regex  -  formal-languages
StackOverflow StackOverflow

Mildly Context sensitive Grammars

https://www.generacodice.com/ru/articolo/12039269/mildly-context-sensitive-grammars
  formal-languages
StackOverflow StackOverflow

Is the following language regular? context free?

https://www.generacodice.com/ru/articolo/12035108/is-the-following-language-regular-context-free
  finite-automata  -  context-free-grammar  -  automata  -  formal-languages  -  regular-language
StackOverflow StackOverflow

Is this the correct way to use the pumping lemma?

https://www.generacodice.com/ru/articolo/11869259/is-this-the-correct-way-to-use-the-pumping-lemma
  finite-automata  -  formal-languages  -  regular-language  -  pumping-lemma
StackOverflow StackOverflow

Union of two (irregular) Context Free Language results a Regular Language?

https://www.generacodice.com/ru/articolo/11741993/union-of-two-irregular-context-free-language-results-a-regular-language
  formal-languages  -  regular-language  -  context-free-language
StackOverflow StackOverflow

Writing a formal language parser with Lisp

https://www.generacodice.com/ru/articolo/11716058/writing-a-formal-language-parser-with-lisp
  lisp  -  scheme  -  racket  -  formal-languages
StackOverflow StackOverflow
Результаты найдены: 2380
scroll top