On lengths of words in context-free languages
type: Item
instance of: scholarly article
title: On lengths of words in context-free languages
zbMATH Open document ID: 0944.68099
DOI: 10.1016/S0304-3975(98)00266-7
author: Lucian Ilie
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03D05
zbMATH DE Number: 1493365
zbMATH Keywords: slender language
zbMATH Keywords: single and paired loops
zbMATH Keywords: decidability
zbMATH Keywords: effective constructions
zbMATH Keywords: context-free language
describes a project that uses: ALGOL 60
MaRDI profile type: Publication
cites work: Language-theoretic problems arising from Richelieu cryptosystems
cites work: Language-theoretic complexity of disjunctive sequences
cites work: A note on decidability questions on presentations of word semigroups
cites work: Q4431364
cites work: Q5576254
cites work: Bounded Algol-Like Languages
cites work: On Parikh slender languages and power series
cites work: Q4520314
cites work: A decision method for Parikh slenderness of context-free languages
cites work: Decision problems concerning thinness and slenderness of formal languages
cites work: Q5592246
cites work: On a conjecture about slender context-free languages
cites work: Q3659988
cites work: Slender 0L languages
cites work: Q4005193
cites work: Closure properties of slender languages
cites work: Thin and slender languages
cites work: On slender context-free languages
cites work: Length considerations in context-free languages
cites work: Q5678435
cites work: Numeration systems, linear recurrences, and regular sets
cites work: Characterizing regular languages with polynomial densities
description: scientific article; zbMATH DE number 1493365