371 search results - page 8 / 75 » Pushdown Automata Simulator |
DLT
2009
14 years 9 months ago
2009
A stateless k-head two-way deterministic finite automaton (k-head 2DFA), has only one state, hence the designation stateless. Its transitions depends solely on the symbols currentl...
103
click to vote
DNA
2004
Springer
15 years 5 months ago
2004
Springer
We propose a new way to implement (general) computing devices with unbounded memory. In particular, we show a procedure to implement automata with unbounded stack memory, push-down...
FSTTCS
2006
Springer
15 years 3 months ago
2006
Springer
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children...
CAV
2006
Springer
15 years 3 months ago
2006
Springer
We study languages of nested trees--structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown program...
SIGCSE
1999
ACM
15 years 4 months ago
1999
ACM
An automata theory course can be taught in an interactive, hands-on manner using a computer. At Duke we have been using the software tool JFLAP to provide interaction and feedback...