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 finite-automata
Search options not deleted
user 110090
Questions about finite automata, an elementary automaton model with finite memory. It is equivalent to regular languages and the basis for many more complex models.
2
votes
1
answer
256
views
Method to construct a finite state machine for a finite-size language L
I need to define a method to construct a finite automata for a finite language L (part of my proof for something else).
My idea:
Create $|L|$ accepting states.
For each input string $s$ from $L$, cr …
- 177
0
votes
1
answer
163
views
Prove $\epsilon(S\cap T)\subseteq S \cap T$
Suppose there are sets $S\subseteq Q, T\subseteq Q$ such that $T=\epsilon (T),S=\epsilon (S)$.
Prove $\epsilon(S\cap T)\subseteq S \cap T$
Definition of $\epsilon$- closure for epsilon NFA i …
- 177
1
vote
1
answer
366
views
Let M be an $\epsilon$-NFA and let $S\subseteq Q$. Prove $\epsilon (S) = \epsilon (\epsilon ...
Let M be an $\epsilon$-NFA and let $S\subseteq Q$. Prove $\epsilon (S)= \epsilon (\epsilon (S))$.
I would like to prove this by contradiction but I don't know if my idea is correct.
Definitio …
- 177