Advanced Search

Match of the following rules

Add Sub-clause

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

Currently displaying 1 – 3 of 3

Order by Relevance | Title | Year of publication

On ambiguity in DOS systems

Andrzej Ehrenfeucht; David Haussler; Grzegorz Rozenberg — 1984

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

A characterization of poly-slender context-free languages

Lucian Ilie; Grzegorz Rozenberg; Arto Salomaa — 2000

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

A characterization of poly-slender context-free languages

Lucian Ilie; Grzegorz Rozenberg; Arto Salomaa — 2010

RAIRO - Theoretical Informatics and Applications

For a non-negative integer , we say that a language is if the number of words of length in is of order $𝒪 (n^{k})$ . We give a precise characterization of the -poly-slender context-free languages. The well-known characterization of the -poly-slender regular languages is an immediate consequence of ours.

Page 1

Download Results (CSV)