The family of (n, k)-bounded pushdown store automata is equivalent to its quasirealtime subfamily, for all n and k. In the course of the proof, a standard form theorem is established for nonterminal bounded context-free grammars and a specialized result is obtained for one-counter languages
We study the mildly context-sensitive class of languages generated by controlled linear grammars wit...
ω-type context-free languages are ω-type languages generated by ω-type context-free grammers, and al...
AbstractThe following are shown to be uniformly erasable: (i) the family of one-counter languages; a...
The family of (n, k)-bounded pushdown store automata is equivalent to its quasirealtime subfamily, f...
AbstractTurn bounded pushdown automata with different conditions for beginning a new turn are invest...
A homomorphism acting on a context-free language L is either e-limited on L, linearly bounded on L, ...
This note describes a special type of one-way, one-tape automata in the sense of Rabin and Scott tha...
Any one counter language that is not nonterminal bounded must contain an infinite regular set; every...
AbstractA pushdown automaton (PDA) is quasi-rocking if it preserves the stack height for no more tha...
AbstractA pushdown automaton (PDA) is quasi-rocking if it preserves the stack height for no more tha...
A language L is called characteristic for a given abstract family of automata if the least AFL conta...
AbstractPushdown automata using a limited and unlimited amount of nondeterminism are investigated. M...
It is well-known that context-free languages defined over a one-letter alpha-bet are regular. This i...
If M is a realtime deterministic pushdown store acceptor, the language L(M) accepted by M by final s...
New families of ω-languages (sets of infinite sequences) associated with context-free languages and ...
We study the mildly context-sensitive class of languages generated by controlled linear grammars wit...
ω-type context-free languages are ω-type languages generated by ω-type context-free grammers, and al...
AbstractThe following are shown to be uniformly erasable: (i) the family of one-counter languages; a...
The family of (n, k)-bounded pushdown store automata is equivalent to its quasirealtime subfamily, f...
AbstractTurn bounded pushdown automata with different conditions for beginning a new turn are invest...
A homomorphism acting on a context-free language L is either e-limited on L, linearly bounded on L, ...
This note describes a special type of one-way, one-tape automata in the sense of Rabin and Scott tha...
Any one counter language that is not nonterminal bounded must contain an infinite regular set; every...
AbstractA pushdown automaton (PDA) is quasi-rocking if it preserves the stack height for no more tha...
AbstractA pushdown automaton (PDA) is quasi-rocking if it preserves the stack height for no more tha...
A language L is called characteristic for a given abstract family of automata if the least AFL conta...
AbstractPushdown automata using a limited and unlimited amount of nondeterminism are investigated. M...
It is well-known that context-free languages defined over a one-letter alpha-bet are regular. This i...
If M is a realtime deterministic pushdown store acceptor, the language L(M) accepted by M by final s...
New families of ω-languages (sets of infinite sequences) associated with context-free languages and ...
We study the mildly context-sensitive class of languages generated by controlled linear grammars wit...
ω-type context-free languages are ω-type languages generated by ω-type context-free grammers, and al...
AbstractThe following are shown to be uniformly erasable: (i) the family of one-counter languages; a...
DOI
Add to ORKG