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-theory
Search options not deleted
user 106151
1
vote
0
answers
56
views
Effect on finite transformation semigroup under a particular modification of the generators
The following question arises in connection with problems in automata theory related to the road problem. Let $f_1, f_2: [N] \to [N]$ be maps such that the transformation semigroup $S = \langle f_1, f …
- 695
0
votes
Given an automatic set $S$ coming from a DFA $M$ when read little-endian, is $\overline{d}(S...
I believe the answer to Question 1 is positive, though maybe I've misunderstood something and the following sketch misses something important.
For $n \in [1,N]$, the DFA halts and decides whether $n \ …
- 695
1
vote
Given an automatic set $S$ coming from a DFA $M$ when read little-endian, is $\overline{d}(S...
I'm posting a new answer because I think the discussion on my previous answer is helpful for understanding the edits to the question, and what I'm adding here is a complete rewrite and is much too lon …
- 695