Add to ORKGIn this paper, we give a deterministic pushdown transducer and a normal sequence of digits compressed by it. This solves positively a question left open in a previous paper by V. Becher, P. A. Heiber and the first author
International audienceWe introduce the synchronization of a pushdown automaton by a sequential trans...
The existence and complexity of decision procedures for families of deterministic pushdown automata ...
We study the descriptional cost of removing nondeterminism in constant height pushdown automata - i....
We prove that finite-state transducers with injective behavior, deterministic or not, real-time or n...
In this talk we focus our attention on deterministic pushdown automata with a one-letter input alpha...
A linear time extension of determinis-tic pushdown automata is introduced that recognizes all determ...
In this paper we introduce a variant of pushdown dimension called bounded pushdown (BPD) dimension, ...
AbstractThe equivalence problem for deterministic pushdown automata is shown to be decidable. We exh...
summary:A new kind of a deterministic pushdown automaton, called a Tree Compression Automaton, is pr...
We introduce a link between automata of level k and tree-structures. Thismethod leads to new decidab...
A set L is (m, n)-computable iff there is a mechanism which on input of n different words produces n...
I ehould like to thank my superviaor, Michael Patergon for hie continued intereat and encouragement ...
Input-driven pushdown automata (IDPDA) are pushdown automata where the next action on the pushdown s...
AbstractReversible pushdown automata are deterministic pushdown automata that are also backward dete...
AbstractThe equivalence problem for deterministic pushdown automata is shown to be decidable. We exh...
International audienceWe introduce the synchronization of a pushdown automaton by a sequential trans...
The existence and complexity of decision procedures for families of deterministic pushdown automata ...
We study the descriptional cost of removing nondeterminism in constant height pushdown automata - i....
We prove that finite-state transducers with injective behavior, deterministic or not, real-time or n...
In this talk we focus our attention on deterministic pushdown automata with a one-letter input alpha...
A linear time extension of determinis-tic pushdown automata is introduced that recognizes all determ...
In this paper we introduce a variant of pushdown dimension called bounded pushdown (BPD) dimension, ...
AbstractThe equivalence problem for deterministic pushdown automata is shown to be decidable. We exh...
summary:A new kind of a deterministic pushdown automaton, called a Tree Compression Automaton, is pr...
We introduce a link between automata of level k and tree-structures. Thismethod leads to new decidab...
A set L is (m, n)-computable iff there is a mechanism which on input of n different words produces n...
I ehould like to thank my superviaor, Michael Patergon for hie continued intereat and encouragement ...
Input-driven pushdown automata (IDPDA) are pushdown automata where the next action on the pushdown s...
AbstractReversible pushdown automata are deterministic pushdown automata that are also backward dete...
AbstractThe equivalence problem for deterministic pushdown automata is shown to be decidable. We exh...
International audienceWe introduce the synchronization of a pushdown automaton by a sequential trans...
The existence and complexity of decision procedures for families of deterministic pushdown automata ...
We study the descriptional cost of removing nondeterminism in constant height pushdown automata - i....