Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with formal-languages
Search options not deleted
user 76308
Questions related to formal languages, grammars, and automata theory
2
votes
1
answer
107
views
Find the grammar for the given language
$L = \{ w: |w| \bmod 3 \geq |w| \bmod 2 \}$
I know, when the length of strings is not $3, 9, 15, 21,\dots,$ they will be members of the given language but unable to write a grammar for this language …
- 225
4
votes
3
answers
2k
views
Definition of Turing Machine as a language acceptor
The following is an excerpt from the book "An Introduction to Formal Languages and Automata" by Peter Linz.
My question is, why is $\Sigma^+$ used and not $\Sigma^\ast$?
- 225
0
votes
1
answer
1k
views
Find the Context Free Grammar
Let $\Sigma = \{a, b\}$. For each of the following languages, find a grammar that generates it.
(a) $L_1 = \{a^n b^m : n\geq 0, m>n\}$
(b) $L_1^3$
(C) $L_1^*$
I know the grammar for the language $ …
- 225