1,467 Hits in 3.2 sec

On a conjecture about slender context-free languages

Lucian Ilie
1994 Theoretical Computer Science  
., On a conjecture about slender context-free languages, Theoretical Computer Science 132 (1994) 4277434.  ...  We prove that every slender context-free language is a union of paired loops, thus confirming a conjecture of Paun and Salomaa to appear.  ...  One of the main problems about slender context-free languages concerns their characterization.  ... 
doi:10.1016/0304-3975(94)00042-5 fatcat:lutxwfiqwffdbf7shiyggszcga

Page 517 of Mathematical Reviews Vol. , Issue 99a [page]

1991 Mathematical Reviews  
The Fliess conjecture states that a commutative language is context-free if and only if it is a B-CF language. The author sharpens his earlier results on the Fliess conjecture.  ...  Summary: “We survey the main results concerning slender lan- guages. We characterize slender regular and context-free languages and show that slenderness is decidable for context-free languages.  ... 

Length considerations in context-free languages

Danny Raz
1997 Theoretical Computer Science  
Thus, we present a length characterization for bounded context-free languages. We then study slender context-free languages, i.e., those containing at most a constant number of words of each length.  ...  We first show that the context-free languages for which the number of words of every length is bounded by a fixed polynomial are exactly the bounded context-free languages in the sense of Ginsburg (1966  ...  P&m and Salomaa conjectured in [7] that every slender context-free language is a UPL, so that the slender context-free languages form a family of unambiguous, but not necessarily deterministic, context-free  ... 
doi:10.1016/s0304-3975(96)00308-8 fatcat:bcsghpe6vrflfd262icx6kzije

Page 2951 of Mathematical Reviews Vol. , Issue 95e [page]

1995 Mathematical Reviews  
{For the entire collection see MR 95c:68012.} 95e:68111 68Q45 Tlie, Lucian (R-BUCHM; Bucharest) On a conjecture about slender context-free languages. (English summary) Theoret. Comput.  ...  Summary: “We prove that every slender context-free language is a union of paired loops, thus confirming a conjecture of Paun and 68Q_ Theory of computing 95e:68115 Salomaa (to appear).  ... 

Author index volume 132 (1994)

1994 Theoretical Computer Science  
., On a conjecture about slender context-free languages (Note) Juedes, D.W., J.I. Lathrop and J.  ...  Diestel Leiss, E.L., Unrestricted complementation in language equations over a one-letter alphabet Lescanne, P., On termination of one rule rewrite systems (Note) Lutz, J., see D.W.  ... 
doi:10.1016/0304-3975(94)90240-2 fatcat:nl7cda6rv5aujncx7kxgty377u

Page 7468 of Mathematical Reviews Vol. , Issue 94m [page]

1994 Mathematical Reviews  
A few open problems are posed: it is conjectured that a language is slender context-free iff it is the finite union of paired loops.  ...  We call such a set of rules a context- free grammar because these rules act like a context-free grammar in the formal language sense.  ... 

A characterization of poly-slender context-free languages

Lucian Ilie, Grzegorz Rozenberg, Arto Salomaa
2000 RAIRO - Theoretical Informatics and Applications  
We give a precise characterization of the kpoly-slender context-free languages. The well-known characterization of the k-poly-slender regular languages is an immediate consequence of ours.  ...  For a non-negative integer k, we say that a language L is k-poly-slender if the number of words of length n in L is of order O(n k ).  ...  For any poly-slender context-free language L, there exists a k 0 such that # L (n) = (n k ).  ... 
doi:10.1051/ita:2000100 fatcat:u5cp7v5dancjvn6hw2rsdhf6wa

On lengths of words in context-free languages

Lucian Ilie
2000 Theoretical Computer Science  
These upper bounds depend on the given language only. Using this result, we give two new and simple proofs for the decidability of the slenderness problem for context-free languages.  ...  Moreover, due to the constructivity of our proof, we are able to ÿnd e ectively a representation as union of paired loops for an arbitrary slender context-free language; even a representation as a disjoint  ...  Also, I thank an anonymous referee for suggesting the result of Ginsburg and Spanier on bounded languages.  ... 
doi:10.1016/s0304-3975(98)00266-7 fatcat:6rper3rhjneglevbwz56qtrp3y

Page 1293 of Mathematical Reviews Vol. , Issue 2003B [page]

2003 Mathematical Reviews  
languages over the binary alphabet (181- 188); Lucian Ilie, On generalized slenderness of context-free lan- guages (189-202); Teruo Imaoka, Prehomomorphisms on locally inverse *-semigroups (203-209); Florentin  ...  Nishida and Shigeko Seki, A definition of Parikh controlled context-free grammars and some properties of them (357-367); Helmut Prodinger, Words, Dyck paths, trees, and bi- jections (369-379); Stuart A  ... 

L Systems [chapter]

Lila Kari, Grzegorz Rozenberg, Arto Salomaa
1997 Handbook of Formal Languages  
that cs(L) cannot be a context-free language.  ...  The language obtained is a classical example in language theory: a context-sensitive language that is not context-free.  ... 
doi:10.1007/978-3-642-59136-5_5 fatcat:5evlmahr75dadkiqepxf7rqkf4

Reference list of indexed articles

1995 Theoretical Computer Science  
Ilie, On a conjecture about slender context-free languages (Nore) 132 (J-2) (1994) 427-434 520. P. DuriS and J.D.P.  ...  Litow, A context-free language decision problem (Note) 125 (2) (1994) 339-343 399. V. Bafna, B. Kalyanasundaram and K.  ... 
doi:10.1016/0304-3975(95)90002-0 fatcat:b7nmywx4tff6lhcd3jkoagotrm

Master index volumes 131–140

1995 Theoretical Computer Science  
., On a conjecture about slender context-free languages (Note) 132 (l-2) (1994) 427-434 Imai, H., see S. Hasegawa 137 (1) (1995) 145-157 Inverardi, P. and M.  ...  languages, with applications to fractal geometry 137 (2) (1995) 177-217 Fiech, A. and M.  ... 
doi:10.1016/0304-3975(95)90075-6 fatcat:dziab64mwne4bbzkayoezzm4gy

Multi-pattern languages

Lila Kari, Alexandru Mateescu, Gheorghe Pǎun, Arto Salomaa
1995 Theoretical Computer Science  
We investigate languages consisting of words following one of the given finitely many patterns.  ...  We obtain results about decidability, characterization, hierarchies and special classes of multi-pattern languages.  ...  The decidability status of the reverse problem (whether or not a given multi-pattern language is context-free) is open.  ... 
doi:10.1016/0304-3975(94)00087-y fatcat:6wefdgqg6naitjba7z24vz53ty

Reviews and Descriptions of Tables and Books

1969 Mathematics of Computation  
on a numerical example.  ...  one variable.  ...  "Context-free languages and Turing machine computations": J.  ... 
doi:10.1090/s0025-5718-69-99858-5 fatcat:avslni5vube3xm5pbrjkli3ewy

Cumulative index volumes 101–150

1995 Theoretical Computer Science  
Hosono 127 (1) (1994) l-23 Ilie, L., On a conjecture about slender context-free languages (Note) 132 (I -2) (1994) 427-434 Iliopoulos, C.S., see J.W. T. and M.  ...  Petersen, Cancellation in context-free languages: enrichment by reduction 127 (1) (1994) 149-170 Jaoua. A., see J. Desharnais 114 (2) (1993) 247-272 Jaoua, A., see J.  ...  Zhang, On weakly confluent monadic string-rewriting systems 113 (1)(1993) 119-165 Madonia, M., S. Salemi and T.  ... 
doi:10.1016/0304-3975(95)90003-9 fatcat:nu4xbvgzrvbfvicemt4sviortu
« Previous Showing results 1 — 15 out of 1,467 results