Number of words of length n in a context-free language












20












$begingroup$


Denote by $w_n$ the number of words of length $n$ in a (possibly ambiguous) context-free language.




What is known about $w_n$?




I'm sure this has been studied a lot, but I couldn't find anything at all on it.






fl.formal-languages context-free







share|cite|improve this question









$endgroup$








  • 4




    $begingroup$
    There is a quasi-polynomial time randoimized algorithm to approximate $w_n$ to within a $(1+epsilon)$ approximation. sciencedirect.com/science/article/pii/S0890540197926213
    $endgroup$
    – Chandra Chekuri
    Nov 14 '18 at 15:15








  • 1




    $begingroup$
    For unambiguous CFLs, the classic Chomsky–Schützenberger enumeration theorem should be of interest.
    $endgroup$
    – Martin Berger
    Nov 14 '18 at 19:10
















20












$begingroup$


Denote by $w_n$ the number of words of length $n$ in a (possibly ambiguous) context-free language.




What is known about $w_n$?




I'm sure this has been studied a lot, but I couldn't find anything at all on it.






fl.formal-languages context-free







share|cite|improve this question









$endgroup$








  • 4




    $begingroup$
    There is a quasi-polynomial time randoimized algorithm to approximate $w_n$ to within a $(1+epsilon)$ approximation. sciencedirect.com/science/article/pii/S0890540197926213
    $endgroup$
    – Chandra Chekuri
    Nov 14 '18 at 15:15








  • 1




    $begingroup$
    For unambiguous CFLs, the classic Chomsky–Schützenberger enumeration theorem should be of interest.
    $endgroup$
    – Martin Berger
    Nov 14 '18 at 19:10














20












20








20


4



$begingroup$


Denote by $w_n$ the number of words of length $n$ in a (possibly ambiguous) context-free language.




What is known about $w_n$?




I'm sure this has been studied a lot, but I couldn't find anything at all on it.






fl.formal-languages context-free







share|cite|improve this question









$endgroup$




Denote by $w_n$ the number of words of length $n$ in a (possibly ambiguous) context-free language.




What is known about $w_n$?




I'm sure this has been studied a lot, but I couldn't find anything at all on it.






fl.formal-languages context-free




fl.formal-languages context-free






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 14 '18 at 10:29









domotorpdomotorp

8,9883080




8,9883080








  • 4




    $begingroup$
    There is a quasi-polynomial time randoimized algorithm to approximate $w_n$ to within a $(1+epsilon)$ approximation. sciencedirect.com/science/article/pii/S0890540197926213
    $endgroup$
    – Chandra Chekuri
    Nov 14 '18 at 15:15








  • 1




    $begingroup$
    For unambiguous CFLs, the classic Chomsky–Schützenberger enumeration theorem should be of interest.
    $endgroup$
    – Martin Berger
    Nov 14 '18 at 19:10














  • 4




    $begingroup$
    There is a quasi-polynomial time randoimized algorithm to approximate $w_n$ to within a $(1+epsilon)$ approximation. sciencedirect.com/science/article/pii/S0890540197926213
    $endgroup$
    – Chandra Chekuri
    Nov 14 '18 at 15:15








  • 1




    $begingroup$
    For unambiguous CFLs, the classic Chomsky–Schützenberger enumeration theorem should be of interest.
    $endgroup$
    – Martin Berger
    Nov 14 '18 at 19:10








4




4




$begingroup$
There is a quasi-polynomial time randoimized algorithm to approximate $w_n$ to within a $(1+epsilon)$ approximation. sciencedirect.com/science/article/pii/S0890540197926213
$endgroup$
– Chandra Chekuri
Nov 14 '18 at 15:15






$begingroup$
There is a quasi-polynomial time randoimized algorithm to approximate $w_n$ to within a $(1+epsilon)$ approximation. sciencedirect.com/science/article/pii/S0890540197926213
$endgroup$
– Chandra Chekuri
Nov 14 '18 at 15:15






1




1




$begingroup$
For unambiguous CFLs, the classic Chomsky–Schützenberger enumeration theorem should be of interest.
$endgroup$
– Martin Berger
Nov 14 '18 at 19:10




$begingroup$
For unambiguous CFLs, the classic Chomsky–Schützenberger enumeration theorem should be of interest.
$endgroup$
– Martin Berger
Nov 14 '18 at 19:10










1 Answer
1






active

oldest

votes


















26












$begingroup$

Every context-free language has either polynomial growth or exponential growth. In the notation of the question poser:




  • Either there is a polynomial $p$ so that $w_nle p(n)$ for all $n$

  • Or there exists a $c>1$, so that $w_nge c^n$ for infinitely many $n$.


This has been shown for instance in:




Roberto Incitti:

"The growth function of context-free languages"

Theoretical Computer Science 255 (2001), Pages 601-605



Martin R. Bridson, Robert H. Gilman:

"Context-Free Languages of Sub-exponential Growth"

Journal of Computer and System Sciences 64 (2002), Pages 308-310




And for a given context-free grammar, one can decide in polynomial time whether the generated language has polynomial or exponential growth:




Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey Shallit:

"Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time.

International Journal of Foundations of Computer Science 21 (2010), Pages 597-618







share|cite|improve this answer











$endgroup$









  • 2




    $begingroup$
    Very interesting connection: The term growth rate is a well known one in group theory and heavily studied. However virtually free groups have exponential growth rate and we know by Muller and Schupp (1983) that word problems of virtually free groups are deterministic context-free. Do you know if there is further work about the growth rate of deterministic context-free languages?
    $endgroup$
    – datell
    Nov 14 '18 at 16:59











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "114"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcstheory.stackexchange.com%2fquestions%2f41878%2fnumber-of-words-of-length-n-in-a-context-free-language%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









26












$begingroup$

Every context-free language has either polynomial growth or exponential growth. In the notation of the question poser:




  • Either there is a polynomial $p$ so that $w_nle p(n)$ for all $n$

  • Or there exists a $c>1$, so that $w_nge c^n$ for infinitely many $n$.


This has been shown for instance in:




Roberto Incitti:

"The growth function of context-free languages"

Theoretical Computer Science 255 (2001), Pages 601-605



Martin R. Bridson, Robert H. Gilman:

"Context-Free Languages of Sub-exponential Growth"

Journal of Computer and System Sciences 64 (2002), Pages 308-310




And for a given context-free grammar, one can decide in polynomial time whether the generated language has polynomial or exponential growth:




Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey Shallit:

"Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time.

International Journal of Foundations of Computer Science 21 (2010), Pages 597-618







share|cite|improve this answer











$endgroup$









  • 2




    $begingroup$
    Very interesting connection: The term growth rate is a well known one in group theory and heavily studied. However virtually free groups have exponential growth rate and we know by Muller and Schupp (1983) that word problems of virtually free groups are deterministic context-free. Do you know if there is further work about the growth rate of deterministic context-free languages?
    $endgroup$
    – datell
    Nov 14 '18 at 16:59
















26












$begingroup$

Every context-free language has either polynomial growth or exponential growth. In the notation of the question poser:




  • Either there is a polynomial $p$ so that $w_nle p(n)$ for all $n$

  • Or there exists a $c>1$, so that $w_nge c^n$ for infinitely many $n$.


This has been shown for instance in:




Roberto Incitti:

"The growth function of context-free languages"

Theoretical Computer Science 255 (2001), Pages 601-605



Martin R. Bridson, Robert H. Gilman:

"Context-Free Languages of Sub-exponential Growth"

Journal of Computer and System Sciences 64 (2002), Pages 308-310




And for a given context-free grammar, one can decide in polynomial time whether the generated language has polynomial or exponential growth:




Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey Shallit:

"Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time.

International Journal of Foundations of Computer Science 21 (2010), Pages 597-618







share|cite|improve this answer











$endgroup$









  • 2




    $begingroup$
    Very interesting connection: The term growth rate is a well known one in group theory and heavily studied. However virtually free groups have exponential growth rate and we know by Muller and Schupp (1983) that word problems of virtually free groups are deterministic context-free. Do you know if there is further work about the growth rate of deterministic context-free languages?
    $endgroup$
    – datell
    Nov 14 '18 at 16:59














26












26








26





$begingroup$

Every context-free language has either polynomial growth or exponential growth. In the notation of the question poser:




  • Either there is a polynomial $p$ so that $w_nle p(n)$ for all $n$

  • Or there exists a $c>1$, so that $w_nge c^n$ for infinitely many $n$.


This has been shown for instance in:




Roberto Incitti:

"The growth function of context-free languages"

Theoretical Computer Science 255 (2001), Pages 601-605



Martin R. Bridson, Robert H. Gilman:

"Context-Free Languages of Sub-exponential Growth"

Journal of Computer and System Sciences 64 (2002), Pages 308-310




And for a given context-free grammar, one can decide in polynomial time whether the generated language has polynomial or exponential growth:




Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey Shallit:

"Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time.

International Journal of Foundations of Computer Science 21 (2010), Pages 597-618







share|cite|improve this answer











$endgroup$



Every context-free language has either polynomial growth or exponential growth. In the notation of the question poser:




  • Either there is a polynomial $p$ so that $w_nle p(n)$ for all $n$

  • Or there exists a $c>1$, so that $w_nge c^n$ for infinitely many $n$.


This has been shown for instance in:




Roberto Incitti:

"The growth function of context-free languages"

Theoretical Computer Science 255 (2001), Pages 601-605



Martin R. Bridson, Robert H. Gilman:

"Context-Free Languages of Sub-exponential Growth"

Journal of Computer and System Sciences 64 (2002), Pages 308-310




And for a given context-free grammar, one can decide in polynomial time whether the generated language has polynomial or exponential growth:




Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey Shallit:

"Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time.

International Journal of Foundations of Computer Science 21 (2010), Pages 597-618








share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Nov 14 '18 at 13:00

























answered Nov 14 '18 at 12:24









GamowGamow

4,04931633




4,04931633








  • 2




    $begingroup$
    Very interesting connection: The term growth rate is a well known one in group theory and heavily studied. However virtually free groups have exponential growth rate and we know by Muller and Schupp (1983) that word problems of virtually free groups are deterministic context-free. Do you know if there is further work about the growth rate of deterministic context-free languages?
    $endgroup$
    – datell
    Nov 14 '18 at 16:59














  • 2




    $begingroup$
    Very interesting connection: The term growth rate is a well known one in group theory and heavily studied. However virtually free groups have exponential growth rate and we know by Muller and Schupp (1983) that word problems of virtually free groups are deterministic context-free. Do you know if there is further work about the growth rate of deterministic context-free languages?
    $endgroup$
    – datell
    Nov 14 '18 at 16:59








2




2




$begingroup$
Very interesting connection: The term growth rate is a well known one in group theory and heavily studied. However virtually free groups have exponential growth rate and we know by Muller and Schupp (1983) that word problems of virtually free groups are deterministic context-free. Do you know if there is further work about the growth rate of deterministic context-free languages?
$endgroup$
– datell
Nov 14 '18 at 16:59




$begingroup$
Very interesting connection: The term growth rate is a well known one in group theory and heavily studied. However virtually free groups have exponential growth rate and we know by Muller and Schupp (1983) that word problems of virtually free groups are deterministic context-free. Do you know if there is further work about the growth rate of deterministic context-free languages?
$endgroup$
– datell
Nov 14 '18 at 16:59


















draft saved

draft discarded




















































Thanks for contributing an answer to Theoretical Computer Science Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid …



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcstheory.stackexchange.com%2fquestions%2f41878%2fnumber-of-words-of-length-n-in-a-context-free-language%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







-

Popular posts from this blog

Bressuire

Image
Subprefecture and commune in Nouvelle-Aquitaine, France Bressuire Subprefecture and commune Chateau de Bressuire and the Eglise Notre-Dame Coat of arms Location of Bressuire Bressuire Show map of France Bressuire Show map of Nouvelle-Aquitaine Coordinates: 46°50′27″N 0°29′14″W  /  46.8408°N 0.4872°W  / 46.8408; -0.4872 Coordinates: 46°50′27″N 0°29′14″W  /  46.8408°N 0.4872°W  / 46.8408; -0.4872 Country France Region Nouvelle-Aquitaine Department Deux-Sèvres Arrondissement Bressuire Canton Bressuire Government  • Mayor .mw-parser-output .nobold{font-weight:normal} (2014–20) Jean Michel Bernier Area 1 180.59 km 2 (69.73 sq mi) Population (2014) 2 19,300  • Density 110/km 2 (280/sq mi) Time zone UTC+01:00 (CET)  • Summer (DST) UTC+02:00 (CEST) INSEE/Postal code 79049 /79300 Elevation 98–236 m (322–774 ft) (avg. 173 m or 568 ft) 1 French Land Register data, which exclude
Read more

Vorschmack

Image
Vorschmack Ukrainian Jewish-style vorschmack served on rye bread Course Hors d'oeuvre Region or state Eastern Europe Associated national cuisine Ashkenazi Jewish, Finnish, German, Ukrainian, Polish, Russian Main ingredients Ground meat and/or fish Cookbook: Vorschmack   Media: Vorschmack Vorschmack or forshmak (Yiddish: פֿאָרשמאַק ‎, from archaic German Vorschmack , "foretaste" [1] or "appetizer" [2] ) is an originally East European dish made of salty minced fish or meat. Different variants of this dish are especially common in Ashkenazi Jewish and Finnish cuisine. Some varieties are also known in Russian and Polish cuisine. Contents 1 In Jewish cuisine 2 In Russian cuisine 3 In Polish cuisine 4 In Finnish cuisine 5 See also 6 References In Jewish cuisine According to Gil Marks, the German name points to the possible Germanic origin of this dish. [1] William Pokhlyobkin descr
Read more

Quarantine

Image
For other uses, see Quarantine (disambiguation). Signal flag "Lima" called the "Yellow Jack" which when flown in harbor means ship is under quarantine. A simple yellow flag (also called the "Yellow Jack") had historically been used to signal quarantine (it stands for Q among signal flags), but now indicates the opposite, as a signal of a ship free of disease that requests boarding and inspection. A quarantine is used to separate and restrict the movement of people; it is 'a restraint upon the activities or communication of persons or the transport of goods designed to prevent the spread of disease or pests', for a certain period of time. [1] This is often used in connection to disease and illness, such as those who may possibly have been exposed to a communicable disease. [2] The term is often erroneously used to mean medical isolation, which is "to separate ill persons who have a communicable disease from those who are healthy
Read more