Results 1 to 10 of about 29,709 (124)
On counting functions and slenderness of languages
Theoretical Computer Science, 2019 We study counting-regular languages -- these are languages $L$ for which there is a regular language $L'$ such that the number of strings of length $n$ in $L$ and $L'$ are the same for all $n$.
Ibarra, Oscar H. +2 more
core +3 more sources
Millet vs rice: an evaluation of the farming/language dispersal hypothesis in the Korean context [PDF]
Evolutionary Human Sciences, 2020 The ‘farming/language dispersal hypothesis’ was originally developed to explain the spread of the Neolithic economy and material culture into Europe. Recently, this hypothesis has been applied towards explaining the dispersal and divergence of East Asian
Jangsuk Kim, Jinho Park
doaj +2 more sources
Theoretical Computer Science, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Taishin Y. Nishida, Arto Salomaa
exaly +3 more sources
Theoretical Computer Science, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Taishin Y. Nishida, Arto Salomaa
exaly +2 more sources
On Parikh slender context-free languages
Theoretical Computer Science, 2001 In a recent paper we defined and studied Parikh slender languages and showed that they can be used in simplifying ambiguity proofs of context-free languages. In this paper Parikh slender context-free languages are characterized. The characterization has diverse applications.
Juha Honkala
exaly +3 more sources
Discrete Applied Mathematics, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gheorghe Pǎun
exaly +2 more sources
Closure properties of slender languages
Theoretical Computer Science, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gheorghe Pǎun
exaly +2 more sources
On Parikh Slender Languages and Power Series
Journal of Computer and System Sciences, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Juha Honkala
exaly +2 more sources
On a conjecture about slender context-free languages
Theoretical Computer Science, 1994 AbstractWe prove that every slender context-free language is a union of paired loops, thus confirming a conjecture of Paˇun and Salomaa to appear. A series of consequences of this result are inferred, most of them also left as open problems in recent papers about slender languages.
Lucian Ilie
exaly +3 more sources
A characterization of poly-slender context-free languages [PDF]
RAIRO - Theoretical Informatics and Applications, 2000 For a language \(L\), let \(\#_L(n)\) be the number of words \(w \in L\) of length \(n\). Then \(L\) is said to be poly-slender, if \(\#_L(n)\) is bounded by a polynomial, and \(L\) is \(k\)-poly-slender, if \(\#_L(n) = O(n^k)\). The authors prove that a context-free language \(L\) is \(k\)-poly-slender if and only if \(L\) is a finite union of \((k+1)\
Lucian Ilie, Grzegorz Rozenberg
exaly +2 more sources