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 3844
formal languages, grammars, automata theory
0
votes
3
answers
218
views
A fsm with temporal events
I have defined a finite state machine
Q = {Σ, S, s0, δ, F}
where
Σ = {'[r]equest', '[o]ut', '[i]n', '[e]nd'}
S = {'[R]eady', '[I]nitiating', '[W]aiting', 'Re[C]eived', 'Re[S]ett …
- 111