textabstractIn this paper, we introduce and study a variant of regulated pushdown automata, called blackhole state-controlled R-PDA where a symbol can always be pushed to the pushdown, but only a given depth of the pushdown contents is remembered; the rest of the pushdown contents is lost. In addition, the automaton can check the form of its pushdown contents according to a given control language. We present characterizations of several language families in terms of these constructs
Abstract. Visibly pushdown automata are special pushdown automata whose stack behavior is driven by ...
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 ...
In this paper, we introduce and study a variant of regulated pushdown automata, called blackhole sta...
This work deals with the design, applicability and the implementation of parsing methods based on pu...
AbstractA generalization of pushdown automata towards regulated nondeterminism is studied. The nonde...
AbstractThis paper introduces a new automaton, called a writing pushdown acceptor (abbreviated wpda)...
The present paper suggests a new investigation area of the formal language theory — regulated automa...
Input-driven pushdown automata (IDPDA) are pushdown automata where the next action on the pushdown s...
International audienceWe introduce the synchronization of a pushdown automaton by a sequential trans...
International audienceWe introduce the synchronization of a pushdown automaton by a sequential trans...
International audienceWe introduce the synchronization of a pushdown automaton by a sequential trans...
This work introduces limited Hromádka's automata as an extension of classical pushdown automata. Thi...
Abstract: We present an algorithm which modifies a deterministic pushdown automaton (DPDA) such that...
AbstractA pushdown automaton (PDA) is quasi-rocking if it preserves the stack height for no more tha...
Abstract. Visibly pushdown automata are special pushdown automata whose stack behavior is driven by ...
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 ...
In this paper, we introduce and study a variant of regulated pushdown automata, called blackhole sta...
This work deals with the design, applicability and the implementation of parsing methods based on pu...
AbstractA generalization of pushdown automata towards regulated nondeterminism is studied. The nonde...
AbstractThis paper introduces a new automaton, called a writing pushdown acceptor (abbreviated wpda)...
The present paper suggests a new investigation area of the formal language theory — regulated automa...
Input-driven pushdown automata (IDPDA) are pushdown automata where the next action on the pushdown s...
International audienceWe introduce the synchronization of a pushdown automaton by a sequential trans...
International audienceWe introduce the synchronization of a pushdown automaton by a sequential trans...
International audienceWe introduce the synchronization of a pushdown automaton by a sequential trans...
This work introduces limited Hromádka's automata as an extension of classical pushdown automata. Thi...
Abstract: We present an algorithm which modifies a deterministic pushdown automaton (DPDA) such that...
AbstractA pushdown automaton (PDA) is quasi-rocking if it preserves the stack height for no more tha...
Abstract. Visibly pushdown automata are special pushdown automata whose stack behavior is driven by ...
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 ...