Add to ORKGAutomata with two-sided pushdowns defined over free groups generated by reduced alphabet
This thesis introduce two new modifications of deep pushdown automata - stateless deep pushdown auto...
This thesis investigates multi pushdown automata and introduces their new modifications based on d...
A new definition of Embedded Push-Down Automata is provided. We prove this new definition preserves ...
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...
summary:This paper introduces and discusses a modification of pushdown automata. This modification i...
In the two-sided pushdown automata discussed in this paper, their two-sided pushdowns are introduced...
Context-free grammars and pushdown automata over infinite alphabets are defined. They are natural ex...
AbstractIn the paper, we deal with the notion of an automaton over a changing alphabet, which genera...
Abstract. We construct automata over a binary alphabet with 2n states, n ≥ 2, whose states freely ge...
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...
For every odd prime $p$ we construct two $p$-automata with 14 inner states and prove that the group ...
This work deals with the design, applicability and the implementation of parsing methods based on pu...
Languages accepted by alternating auxiliary pushdown automata using simultaneously a(n) alternations...
This thesis introduce two new modifications of deep pushdown automata - stateless deep pushdown auto...
This thesis investigates multi pushdown automata and introduces their new modifications based on d...
A new definition of Embedded Push-Down Automata is provided. We prove this new definition preserves ...
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...
summary:This paper introduces and discusses a modification of pushdown automata. This modification i...
In the two-sided pushdown automata discussed in this paper, their two-sided pushdowns are introduced...
Context-free grammars and pushdown automata over infinite alphabets are defined. They are natural ex...
AbstractIn the paper, we deal with the notion of an automaton over a changing alphabet, which genera...
Abstract. We construct automata over a binary alphabet with 2n states, n ≥ 2, whose states freely ge...
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...
For every odd prime $p$ we construct two $p$-automata with 14 inner states and prove that the group ...
This work deals with the design, applicability and the implementation of parsing methods based on pu...
Languages accepted by alternating auxiliary pushdown automata using simultaneously a(n) alternations...
This thesis introduce two new modifications of deep pushdown automata - stateless deep pushdown auto...
This thesis investigates multi pushdown automata and introduces their new modifications based on d...
A new definition of Embedded Push-Down Automata is provided. We prove this new definition preserves ...