A homomorphism acting on a context-free language L is either e-limited on L, linearly bounded on L, or of unbounded erasing on L. There are context-free AFLs not closed under linear erasing; there are context-free AFLs closed under linear erasing but not under arbitrary erasing. It is undecidable whether a context-free language is erasable, linearly erasable, or uniformly erasable
A full AFL is defined to be full-bounded if it can be generated by a set of boundedlanguages. It is ...
A language L is called characteristic for a given abstract family of automata if the least AFL conta...
AbstractWe study Turing machines that are allowed absolutely no space overhead. The only work space ...
A homomorphism acting on a context-free language L is either e-limited on L, linearly bounded on L, ...
In this note, properties of the “f-bounded erasing” operator Hf are studied. The operator Hf maps a ...
A full AFL ℒ is uniformly ℱ-erasable if in every AFA defining ℒ (where each automaton signals accept...
Any one counter language that is not nonterminal bounded must contain an infinite regular set; every...
The family of (n, k)-bounded pushdown store automata is equivalent to its quasirealtime subfamily, f...
A full AFL ℒ is uniformly ℱ-erasable if in every AFA defining ℒ (where each automaton signals accept...
A basic result which gives a condition under which a (possibly length-decreasing) homomorphism prese...
This note describes a special type of one-way, one-tape automata in the sense of Rabin and Scott tha...
If K is not a context-free language, then sh(K, a*) is not an EOL language (where sh(K1, K2) denotes...
A language is m-bounded if it is a subset of w1*…wm* for some words w1, …, wm. A study is made of th...
A simple sufficiency condition is given for an abstract family of acceptors (abbreviated AFA) to def...
AbstractThe following are shown to be uniformly erasable: (i) the family of one-counter languages; a...
A full AFL is defined to be full-bounded if it can be generated by a set of boundedlanguages. It is ...
A language L is called characteristic for a given abstract family of automata if the least AFL conta...
AbstractWe study Turing machines that are allowed absolutely no space overhead. The only work space ...
A homomorphism acting on a context-free language L is either e-limited on L, linearly bounded on L, ...
In this note, properties of the “f-bounded erasing” operator Hf are studied. The operator Hf maps a ...
A full AFL ℒ is uniformly ℱ-erasable if in every AFA defining ℒ (where each automaton signals accept...
Any one counter language that is not nonterminal bounded must contain an infinite regular set; every...
The family of (n, k)-bounded pushdown store automata is equivalent to its quasirealtime subfamily, f...
A full AFL ℒ is uniformly ℱ-erasable if in every AFA defining ℒ (where each automaton signals accept...
A basic result which gives a condition under which a (possibly length-decreasing) homomorphism prese...
This note describes a special type of one-way, one-tape automata in the sense of Rabin and Scott tha...
If K is not a context-free language, then sh(K, a*) is not an EOL language (where sh(K1, K2) denotes...
A language is m-bounded if it is a subset of w1*…wm* for some words w1, …, wm. A study is made of th...
A simple sufficiency condition is given for an abstract family of acceptors (abbreviated AFA) to def...
AbstractThe following are shown to be uniformly erasable: (i) the family of one-counter languages; a...
A full AFL is defined to be full-bounded if it can be generated by a set of boundedlanguages. It is ...
A language L is called characteristic for a given abstract family of automata if the least AFL conta...
AbstractWe study Turing machines that are allowed absolutely no space overhead. The only work space ...
DOI
Add to ORKG