AbstractThe following are shown to be uniformly erasable: (i) the family of one-counter languages; and (ii) every family of one-letter languages
Given a subset S of N, filtering a word a_0a_1 ... a_n by S consists in deleting the letters a_i suc...
A homomorphism acting on a context-free language L is either e-limited on L, linearly bounded on L, ...
This paper discusses a family of star-free languages, over a two letter alphabet, which generalizes ...
AbstractThe following are shown to be uniformly erasable: (i) the family of one-counter languages; a...
A full AFL ℒ is uniformly ℱ-erasable if in every AFA defining ℒ (where each automaton signals accept...
A full AFL ℒ is uniformly ℱ-erasable if in every AFA defining ℒ (where each automaton signals accept...
AbstractWe study full trios generated by commutative languages. We give, for instance, a necessary a...
The family of (n, k)-bounded pushdown store automata is equivalent to its quasirealtime subfamily, f...
Any one counter language that is not nonterminal bounded must contain an infinite regular set; every...
A homomorphism acting on a context-free language L is either e-limited on L, linearly bounded on L, ...
In the theory of automata and formal languages, the undecidability of various properties has been st...
AbstractA new characterization of commutative regular languages is given. Using it, it is proved tha...
We introduce the notion of language uniform theory and study topological properties related to famil...
Abstract. Given a subset S of N, ltering a word a0a1 an by S con-sists in deleting the letters...
The full scan condition on a language L introduced in [1] ensures that a word w must be completely i...
Given a subset S of N, filtering a word a_0a_1 ... a_n by S consists in deleting the letters a_i suc...
A homomorphism acting on a context-free language L is either e-limited on L, linearly bounded on L, ...
This paper discusses a family of star-free languages, over a two letter alphabet, which generalizes ...
AbstractThe following are shown to be uniformly erasable: (i) the family of one-counter languages; a...
A full AFL ℒ is uniformly ℱ-erasable if in every AFA defining ℒ (where each automaton signals accept...
A full AFL ℒ is uniformly ℱ-erasable if in every AFA defining ℒ (where each automaton signals accept...
AbstractWe study full trios generated by commutative languages. We give, for instance, a necessary a...
The family of (n, k)-bounded pushdown store automata is equivalent to its quasirealtime subfamily, f...
Any one counter language that is not nonterminal bounded must contain an infinite regular set; every...
A homomorphism acting on a context-free language L is either e-limited on L, linearly bounded on L, ...
In the theory of automata and formal languages, the undecidability of various properties has been st...
AbstractA new characterization of commutative regular languages is given. Using it, it is proved tha...
We introduce the notion of language uniform theory and study topological properties related to famil...
Abstract. Given a subset S of N, ltering a word a0a1 an by S con-sists in deleting the letters...
The full scan condition on a language L introduced in [1] ensures that a word w must be completely i...
Given a subset S of N, filtering a word a_0a_1 ... a_n by S consists in deleting the letters a_i suc...
A homomorphism acting on a context-free language L is either e-limited on L, linearly bounded on L, ...
This paper discusses a family of star-free languages, over a two letter alphabet, which generalizes ...
DOI
Add to ORKG