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 fl.formal-languages
Search options not deleted
user 72423
formal languages, grammars, automata theory
1
vote
Equivalence between GNFA and NFA/DFA
You agree that every GNFA has a corresponding regular expression. Then we know that each regular expression has a corresponding DFA, and an NFA.
Thus we can follow the path of GNFA-> reg. exp.-> NFA p …
- 11
0
votes
Modify DCFG to enforce length limit
Here is one algorithm:-
Step 1: Convert the grammar to CNF. This should take time O(square of no. Of productions)
Idea: The basic idea is to subscript each use of non terminals. For each variable X, X …
- 11