Filters
On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops
This paper introduces and discusses pure multi-pushdown automata that remove symbols from their pushdowns only by performing complete pushdown pops. This means that during a pop operation, the entire p...
BD - Teorie informace
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops
This paper introduces and discusses pure multi-pushdown automata that remove symbols from their pushdowns only by performing complete-pushdown pops. During this operation, the entire pushdown is c...
BD - Teorie informace
- 2008 •
- D
Rok uplatnění
D - Stať ve sborníku
Ordered Pure Multi-Pushdown Automata
In the presented paper we discuss pure versions of pushdown automata that have no extra non-input symbols. More specifically, we study pure multi-pushdown automata, which have several pushdown lis...
IN - Informatika
- 2015 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Tree compression pushdown automaton
A new kind of a deterministic pushdown automaton, called a Tree Compression Automaton, is presented. The tree compression automaton represents a complete compressed. The algorithm for constructing our pushdown<...
IN - Informatika
- 2012 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Two-Sided Pushdown Automata over Free Groups
In the two-sided pushdown automata discussed in this paper, their two-sided pushdowns are introduced over free groups rather than free monoids. It is demonstrated that these automata with pushdowns introduced in this way ch...
JC - Počítačový hardware a software
- 2006 •
- D
Rok uplatnění
D - Stať ve sborníku
Blackhole pushdown automata
, where the automaton in some distinguished states checks the form of its pushdownWe introduce and investigate blackhole pushdown automata, variants of pushdown automata, where a string can always be pushed to the ...
BA - Obecná matematika
- 2011 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Internally Expandable Pushdown Automata and Their Computational Completeness
The present paper defines the notion of an internally expandable pushdown automaton (IEPDA). In essence, this automaton expands the topmost expandable non-input symbol in its pushdown list. This expanded symbol, ho...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2018 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Indexing Trees by Pushdown Automata for Nonlinear Tree Pattern Matching
A new kind of an acyclic pushdown automaton for an ordered tree is presented. The nonlinear tree pattern pushdown automaton represents a complete index of the tree complexities of the nondeterministic nonlinear tre...
IN - Informatika
- 2011 •
- O •
- Link
Rok uplatnění
O - Ostatní výsledky
Výsledek na webu
Construction of a Pushdown Automaton Accepting a Postfix Notation of a Tree Language Given by a Regular Tree Expression
Regular tree expressions are a formalism for describing regular tree languages, which can be accepted by a finite tree automaton as a standard model of computation languages those linear notations can be accepted by deterministic string
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2018 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Simulation of LLk Parsers with Wide Context by Automaton with One-Symbol Reading Head
. This paper presents algorithm that allows transformation
from pushdown automaton-symbol reading
head pushdown automaton. Thus, we can simulate a functionThe LL grammars play important role in the programm...
JC - Počítačový hardware a software
- 2004 •
- D
Rok uplatnění
D - Stať ve sborníku
- 1 - 10 out of 30 436