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 82
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.
21
votes
Accepted
Decide whether a context-free languages can be accepted by a deterministic pushdown automaton
There is no algorithm that given a context-free grammar, decide if a DPDA recognizes the same language and computes it if it exists.
Because if such an algorithm existed, we would be able to decide t …
- 9,548
5
votes
Optimal myopic maze solver
Question 1
I think your definition of better is too strict in the sense that finite is too restrictive (but I don't have any better definition).
We build a family of mazes $R=(R_i)_i$. Each one $R_i$ …
- 9,548
5
votes
DFA with limited states
The pumping lemma can be refined for automata with fixed number of states which is exaclty wikipedia's $p$ in "there exists $p$ such that ...". … Use the automata for $M_n$ to build your DFA for $L_z$.
EDIT: I removed the last part: you can use the pumping lemma to prove the minimum size for $M_n$ but not (at least not directly) for $L_z$. …
- 9,548
4
votes
What is the significance of context-sensitive (Type 1) languages?
The Chomsky hierarchy classifies grammars more than languages. However it was not designed to have something to do with the number of tapes a automaton should have to recognize it, as you suggested fo …
- 9,548
17
votes
Are Turing machines more powerful than pushdown automata?
This simple task cannot be done with a pushdown transducer (roughly the same thing as the pushdown automata, but that can write things at each step), but can easily be done with a tape:
Read a string …
- 9,548