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 automata
Search options not deleted
user 170970
Questions about mathematical devices that read an input stream symbol by symbol and use a state transition map to produce an output stream, maybe using secondary storage.
5
votes
1
answer
58
views
What is the name of a DFA where all long enough words are synchronizing words?
To be clear, I'm talking about DFA automata with no defined initial or accepting states. … Maybe it is too "trivial", but I find it weird given that I see this as basically the automata version of self-synchronizing codes (ie. self-synchronizing automata, or "forgetful" automata which only depend …
- 153