Add to ORKGThe techniques of automatic programming are useful for constructive proofs in automata theory. A formal definition of an elementary programming language for a stack automaton is given, and it is shown how this may be readily adapted to other classes of automata. The second part of this paper shows how this programming language can be applied to automata theory, as we prove there are non-context-sensitive languages accepted by a stack automaton
In this paper we present the new version of a tool to assist in teaching formal languages and automa...
A formal idealization of the data structures used in many “list processing” languages is defined. It...
ω-type context-free languages are ω-type languages generated by ω-type context-free grammers, and al...
The techniques of automatic programming are useful for constructive proofs in automata theory. A for...
These lecture notes present some basic notions and results on Automata Theory, Formal Languages The...
From a biological point of view automata arrays have been employed by John von Neumann in order to s...
This book is aimed at providing an introduction to the basic models of computability to the undergra...
A stack automaton is a pushdown automaton that can read the interior of its pushdown list without al...
Abstract. We consider in this paper so called simple bracketed languages having special limita-tions...
Abstract. The automata-theoretic approach to linear temporal logic uses the theory of automata as a ...
A well-known theorem in automata theory states that every context-free language is accepted by a pus...
Automata with counter monoids, grammars and automata, context sensitive languages and word problems ...
AbstractThis paper presents a new type of automaton called a tree pushdown automaton (a bottom-up tr...
Even if Domain Specific Languages (DSL) are not well-known, they are quite used. Indeed, these langu...
. The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying...
In this paper we present the new version of a tool to assist in teaching formal languages and automa...
A formal idealization of the data structures used in many “list processing” languages is defined. It...
ω-type context-free languages are ω-type languages generated by ω-type context-free grammers, and al...
The techniques of automatic programming are useful for constructive proofs in automata theory. A for...
These lecture notes present some basic notions and results on Automata Theory, Formal Languages The...
From a biological point of view automata arrays have been employed by John von Neumann in order to s...
This book is aimed at providing an introduction to the basic models of computability to the undergra...
A stack automaton is a pushdown automaton that can read the interior of its pushdown list without al...
Abstract. We consider in this paper so called simple bracketed languages having special limita-tions...
Abstract. The automata-theoretic approach to linear temporal logic uses the theory of automata as a ...
A well-known theorem in automata theory states that every context-free language is accepted by a pus...
Automata with counter monoids, grammars and automata, context sensitive languages and word problems ...
AbstractThis paper presents a new type of automaton called a tree pushdown automaton (a bottom-up tr...
Even if Domain Specific Languages (DSL) are not well-known, they are quite used. Indeed, these langu...
. The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying...
In this paper we present the new version of a tool to assist in teaching formal languages and automa...
A formal idealization of the data structures used in many “list processing” languages is defined. It...
ω-type context-free languages are ω-type languages generated by ω-type context-free grammers, and al...