Add to ORKGWe design succinct nondeterministic finite automata accepting pushdown store languages \u2014 i.e., the languages consisting of the pushdown contents along accepting computations of pushdown automata. Then, several restricted variants of pushdown automata are considered, leading to improved constructions. Finally, we apply our results to decidability questions related to pushdown automat
The simulation of deterministic pushdown automata defined over a one letter alphabet by finite state...
AbstractThe general notion of look-ahead on pushdowns is used to prove that (1) the deterministic it...
We propose the class of visibly pushdown languages as embeddings of context-free languages that is r...
It is well known that the pushdown store language P(M) of a pushdown automaton (PDA) M - i.e., the l...
This thesis introduces several modifications of deep pushdown automata considering the reduced numbe...
Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input ...
Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input ...
AbstractPushdown automata using a limited and unlimited amount of nondeterminism are investigated. M...
Abstract. Visibly pushdown automata are special pushdown automata whose stack behavior is driven by ...
It is well known that the pushdown store language P(M) of a pushdown automaton (PDA) M i.e., the l...
International audienceWe study the expressiveness and succinctness of good-for-games pushdown automa...
AbstractA generalization of pushdown automata towards regulated nondeterminism is studied. The nonde...
International audienceWe study the expressiveness and succinctness of good-for-games pushdown automa...
International audienceWe study the expressiveness and succinctness of good-for-games pushdown automa...
Abstract. Checking whether one formal language is included in another is vital to many verification ...
The simulation of deterministic pushdown automata defined over a one letter alphabet by finite state...
AbstractThe general notion of look-ahead on pushdowns is used to prove that (1) the deterministic it...
We propose the class of visibly pushdown languages as embeddings of context-free languages that is r...
It is well known that the pushdown store language P(M) of a pushdown automaton (PDA) M - i.e., the l...
This thesis introduces several modifications of deep pushdown automata considering the reduced numbe...
Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input ...
Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input ...
AbstractPushdown automata using a limited and unlimited amount of nondeterminism are investigated. M...
Abstract. Visibly pushdown automata are special pushdown automata whose stack behavior is driven by ...
It is well known that the pushdown store language P(M) of a pushdown automaton (PDA) M i.e., the l...
International audienceWe study the expressiveness and succinctness of good-for-games pushdown automa...
AbstractA generalization of pushdown automata towards regulated nondeterminism is studied. The nonde...
International audienceWe study the expressiveness and succinctness of good-for-games pushdown automa...
International audienceWe study the expressiveness and succinctness of good-for-games pushdown automa...
Abstract. Checking whether one formal language is included in another is vital to many verification ...
The simulation of deterministic pushdown automata defined over a one letter alphabet by finite state...
AbstractThe general notion of look-ahead on pushdowns is used to prove that (1) the deterministic it...
We propose the class of visibly pushdown languages as embeddings of context-free languages that is r...