Any one counter language that is not nonterminal bounded must contain an infinite regular set; every generator of the family of one counter languages must contain an infinite regular set. Any language that is in the substitution closure of the linear and one counter languages but is not derivation bounded must contain an infinite regular set
We study the Boolean algebras R, CS, D of regular languages, context-sensitive languages and decidab...
We study the Boolean algebras R, CS, D of regular languages, context-sensitive languages and decidab...
We consider the possibility to obtain a regular language by applying a given operation to a context-...
Dedicated to András Kornai on occasion of his 50th birthday A language L ⊆ A ∗ is counter free if t...
A homomorphism acting on a context-free language L is either e-limited on L, linearly bounded on L, ...
A language is m-bounded if it is a subset of w1*…wm* for some words w1, …, wm. A study is made of th...
The family of (n, k)-bounded pushdown store automata is equivalent to its quasirealtime subfamily, f...
A full AFL is defined to be full-bounded if it can be generated by a set of boundedlanguages. It is ...
AbstractThis paper considers conditions under which a context-free language is regular and condition...
AbstractA derivation in a phrase-structure grammar is said to be k-bounded if each word in the deriv...
AbstractA new characterization of commutative regular languages is given. Using it, it is proved tha...
The family of (n, k)-bounded pushdown store automata is equivalent to its quasirealtime subfamily, f...
AbstractThis paper considers conditions under which a context-free language is regular and condition...
International audienceBounded languages have recently proved to be an important class of languages f...
AbstractWe study the Boolean algebras R,CS,D of regular languages, context-sensitive languages and d...
We study the Boolean algebras R, CS, D of regular languages, context-sensitive languages and decidab...
We study the Boolean algebras R, CS, D of regular languages, context-sensitive languages and decidab...
We consider the possibility to obtain a regular language by applying a given operation to a context-...
Dedicated to András Kornai on occasion of his 50th birthday A language L ⊆ A ∗ is counter free if t...
A homomorphism acting on a context-free language L is either e-limited on L, linearly bounded on L, ...
A language is m-bounded if it is a subset of w1*…wm* for some words w1, …, wm. A study is made of th...
The family of (n, k)-bounded pushdown store automata is equivalent to its quasirealtime subfamily, f...
A full AFL is defined to be full-bounded if it can be generated by a set of boundedlanguages. It is ...
AbstractThis paper considers conditions under which a context-free language is regular and condition...
AbstractA derivation in a phrase-structure grammar is said to be k-bounded if each word in the deriv...
AbstractA new characterization of commutative regular languages is given. Using it, it is proved tha...
The family of (n, k)-bounded pushdown store automata is equivalent to its quasirealtime subfamily, f...
AbstractThis paper considers conditions under which a context-free language is regular and condition...
International audienceBounded languages have recently proved to be an important class of languages f...
AbstractWe study the Boolean algebras R,CS,D of regular languages, context-sensitive languages and d...
We study the Boolean algebras R, CS, D of regular languages, context-sensitive languages and decidab...
We study the Boolean algebras R, CS, D of regular languages, context-sensitive languages and decidab...
We consider the possibility to obtain a regular language by applying a given operation to a context-...
DOI
Add to ORKG