Tagged Questions
0
votes
1answer
43 views
Legal actions on a PDA and terminology
I am unsure about the following so I would like to verify if my statements
are true:
We can remove at most a single character ($Z\in\Gamma$) from the
PDA (top ?) of the stack with one step of the ...
2
votes
1answer
58 views
Definition of a deterministic Pushdown automaton
According to my book the definition of a deterministic Pushdown automaton
allows for $\delta(q,\epsilon,Z)$ to be non-empty if $$\forall\sigma\in\Sigma:\,\delta(q,\sigma,Z)\neq\emptyset$$
Can someone ...
0
votes
2answers
61 views
Pushdown automata - definition and definition of $\vdash$
I am reading about pushdown automata and I don't understand the definition
of $\vdash$.
My book writes that $$(q,aw,Z\alpha)\vdash(p,w,\beta\alpha)$$ if $$(p,\beta)\in\delta(q,a,Z)$$
Can someone ...
1
vote
1answer
58 views
How to formally describe this Uppaal automata?
I have the following simple automata:
What I'm looking for is a formal description of this based on the definition here
$A=(\Sigma,\Gamma,S,s_0,\delta,\omega, F)$
How to declare all the ...
