Add to ORKGsummary:This paper introduces and discusses a modification of pushdown automata. This modification is based on two-sided pushdowns into which symbols are pushed from both ends. These pushdowns are defined over free groups, not free monoids, and they can be shortened only by the standard group reduction. We demonstrate that these automata characterize the family of recursively enumerable languages even if the free groups are generated by no more than four symbols
In this paper we introduce context-free grammars and pushdown automata over infinite alphabets. It i...
The investigation of automata and languages defined over a one letter alphabet shows interesting dif...
We design succinct nondeterministic finite automata accepting pushdown store languages \u2014 i.e., ...
In the two-sided pushdown automata discussed in this paper, their two-sided pushdowns are introduced...
summary:This paper introduces and discusses a modification of pushdown automata. This modification i...
summary:This paper introduces and discusses a modification of pushdown automata. This modification i...
Automata with two-sided pushdowns defined over free groups generated by reduced alphabet
Flip-pushdown automata are pushdown automata with an extra ability to reverse the contents of the pu...
The present paper suggests a new investigation area of the formal language theory — regulated automa...
This work deals with the design, applicability and the implementation of parsing methods based on pu...
Context-free grammars and pushdown automata over infinite alphabets are defined. They are natural ex...
AbstractThis paper presents a new type of automaton called a tree pushdown automaton (a bottom-up tr...
In the presented paper we discuss pure versions of pushdown automata that have no extra non-input sy...
In the presented paper we discuss pure versions of pushdown automata that have no extra non-input sy...
This thesis introduces several modifications of deep pushdown automata considering the reduced numbe...
In this paper we introduce context-free grammars and pushdown automata over infinite alphabets. It i...
The investigation of automata and languages defined over a one letter alphabet shows interesting dif...
We design succinct nondeterministic finite automata accepting pushdown store languages \u2014 i.e., ...
In the two-sided pushdown automata discussed in this paper, their two-sided pushdowns are introduced...
summary:This paper introduces and discusses a modification of pushdown automata. This modification i...
summary:This paper introduces and discusses a modification of pushdown automata. This modification i...
Automata with two-sided pushdowns defined over free groups generated by reduced alphabet
Flip-pushdown automata are pushdown automata with an extra ability to reverse the contents of the pu...
The present paper suggests a new investigation area of the formal language theory — regulated automa...
This work deals with the design, applicability and the implementation of parsing methods based on pu...
Context-free grammars and pushdown automata over infinite alphabets are defined. They are natural ex...
AbstractThis paper presents a new type of automaton called a tree pushdown automaton (a bottom-up tr...
In the presented paper we discuss pure versions of pushdown automata that have no extra non-input sy...
In the presented paper we discuss pure versions of pushdown automata that have no extra non-input sy...
This thesis introduces several modifications of deep pushdown automata considering the reduced numbe...
In this paper we introduce context-free grammars and pushdown automata over infinite alphabets. It i...
The investigation of automata and languages defined over a one letter alphabet shows interesting dif...
We design succinct nondeterministic finite automata accepting pushdown store languages \u2014 i.e., ...