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 82288
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.
0
votes
Example of two undecidable languages that cannot be mapping reduced to each other
A really simple example is $A_\mathrm{TM}$ (i.e. the language of $\langle M, w \rangle$ where TM $M$ accepts $w$) and its complement $\overline{A_\mathrm{TM}}$.
$A_\mathrm{TM}$ is recognizable but not …
- 858