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 20461
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.
1
vote
1
answer
91
views
Why does a DFA either contain all or no words $a^k$ if it loops for $a$ in all states?
I am trying to solve this particular problem from Automata Theory by Ullman, Hopcroft, it is as shown below:
Let $A$ be a $DFA$ and $a$ be a particular input symbol of $A$, such that for all states $ …
1
vote
1
answer
306
views
Closure properties between 2 languages of different types [duplicate]
Whenever said - The intersection between a Context Free Language and a Regular Language is always Context Free, what is the best logical way to confirm the statement?
I have this Chomsky hierarchy in …
0
votes
1
answer
947
views
Why is $L=wxw^R|w,x\in\{0,1\}^+$ regular? [duplicate]
I was taught that if you can create a DFA to accept a language, then the grammar that is generating the language is regular.
AND
A DFA is a finite automata that accepts a language and also rejects t …