Results 211 to 220 of about 29,808 (223)

On slender languages

Bull. EATCS, 2020
Summary: We survey main results concerning slender languages. We characterize slender regular and context-free languages and show that slenderness is decidable for context-free languages. Also a connection between slender languages, Cobham's theorem and ambiguity of coprefix languages of infinite words is discussed.
openaire   +1 more source

A note on grammatical inference of slender context-free languages

1996
In this paper, we consider the grammatical inference problem of slender context-free languages from the point of view of cryptosystems. We show that the inference problem of slender context-free languages is not hard, and therefore, the languages have some weakness as cryptosystems.
Yuji Takada, Taishin Y. Nishida
openaire   +1 more source

Decision problems concerning thinness and slenderness of formal languages

Acta Informatica, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On slender context-free languages

1995
In this paper we study slender context-free languages, i.e., those containing at most a constant number of words of each length. Recently, Ilie proved that every such language can be described by a finite union of terms of the form uv i wx i y [I]. We provide a completely different proof of this, using constructive methods.
openaire   +1 more source

A Chomsky-Schützenberger-Stanley type characterization of the class of slender context-free languages

Acta Cybern., 2001
Slender context-free languages are context-free languages for which the number of words of the same length is bounded by a constant. The paper provides a Chomsky-Schützenberger-Stanley characterization of slender context-free languages, i.e., a characterization employing homomorphisms applied to the intersection of a regular language and a simple ...
Pál Dömösi, Satoshi Okawa
openaire   +2 more sources

Word Length Controlled DT0L Systems and Slender Languages

1999
We introduce a new controlled DT0L system, called a word length controlled DT0L system, or a wlcDT0L system for short. A wlcDT0L system is a DT0L system with a control function which maps from the set of nonnegative integers to the set of tables. A wlcDT0L system derives exactly one word from a given word by iterating the table which is the value of ...
openaire   +1 more source

ON GENERALIZED SLENDERNESS OF CONTEXT-FREE LANGUAGES

2001
openaire   +1 more source

Chomsky-Schützenberger Type Characterizations of Poly-Slender and Parikh Slender Context-Free Languages1 1Work supported by the Grants-in Aid for Scientific Research No. 1 0440034, Japan Society for the Promotion of Sciences and the Dirección General de Enseñanza Superior e Investigación Cientifica, SB 97-00110508

Electronic Notes in Theoretical Computer Science, 2004
Carlos Martin-Vide, Víctor Mitrana
exaly  

On Slender Context-Free Languages.

2006
Pál Dömösi, Alexandru Mateescu
openaire  

A note on grammatical inference of slender context-free languages

Lecture Notes in Computer Science, 2005
exaly