Filters








35,531 Hits in 4.5 sec

Page 232 of Mathematical Reviews Vol. 39, Issue 1 [page]

<span title="">1970</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
1246-1248 Maurer, Herman A. 1246 A direct proof of the inherent ambiguity of a simple context-free . J. Assoc. Comput. Mach. 16 (1969), 256-260.  ...  Author’s summary : “A direct and self-contained proof is given of the inherent ambiguity of the context-free language L ={a'b‘c’|i, j > 1} U {a'b’c’|i, 7 > 1}, which is the solution to an open problem  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1970-01_39_1/page/232" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1970-01_39_1/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Analytic models and ambiguity of context-free languages

Philippe Flajolet
<span title="">1987</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
In particular, the paper contains a general density theorem for unambiguous context-free languages. 286 Ph. Najolet  ...  We establish that several classical context-free languages are inherently ambiguous by proving that their counting generating functions, when considered as analytic functions, exhibit some characteristic  ...  A context-free language L is inherently ambiguous iff any grammar that generates L is ambiguous.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(87)90011-9">doi:10.1016/0304-3975(87)90011-9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xevbe5xstrbohl7ilcncondps4">fatcat:xevbe5xstrbohl7ilcncondps4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190413095230/https://core.ac.uk/download/pdf/81108511.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a6/90/a690455e89804d25cdade7fad4e82c4470782775.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(87)90011-9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Some inherently ambiguous context-free languages

Eliahu Shamir
<span title="">1971</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fbkexx2qg5anljkxraobuswdq4" style="color: black;">Information and Control</a> </i> &nbsp;
We prove the inherent ambiguity of certain context-free languages, the prototype of which is L = {s2t I t = v'gv, s, v, v" ~ {0, 1}*}, (g is the reflection of s).  ...  We also prove inherent direct ambiguity (of infinite degree) of certain languages, and the recursive unsolvability of that property.  ...  For the construction of simple examples exhibiting inherent ambiguity or inherent direct ambiguity, or the recursive unsolvability of these properties, we need only the simplest antimorphism ~(x)= {~},  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0019-9958(71)90455-4">doi:10.1016/s0019-9958(71)90455-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/k2lm4rk54vdfvoylvehzgvq2pq">fatcat:k2lm4rk54vdfvoylvehzgvq2pq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190330070730/https://core.ac.uk/download/pdf/82567514.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8c/1b/8c1b60735df4e66633bcf44d12d77e877398ceb9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0019-9958(71)90455-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

On Parikh Slender Languages and Power Series

Juha Honkala
<span title="">1996</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p6ovb2qpkfenhmb7mcksobrcxq" style="color: black;">Journal of computer and system sciences (Print)</a> </i> &nbsp;
As an application we get a new method for ambiguity proofs of context-free languages and a new proof of an earlier result of Autebert, Flajolet, and Gabarro concerning prefixes of infinite words. ]  ...  We define and study Parikh slender languages and power series. A language is Parikh slender if the number of words in the language with the same Parikh vector is bounded from above.  ...  ACKNOWLEDGMENT The author is deeply grateful to Professor Arto Salomaa for useful discussions concerning this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/jcss.1996.0014">doi:10.1006/jcss.1996.0014</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4q5xjwiecrdobnuwbsp26xll3q">fatcat:4q5xjwiecrdobnuwbsp26xll3q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170927201740/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/599/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDAyMjAwMDA5NjkwMDE0OA%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/35/d0/35d0ac7e1d46898214a0cb7836bf17be0dfb5778.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/jcss.1996.0014"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Page 504 of Mathematical Reviews Vol. 35, Issue 2 [page]

<span title="">1968</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Chapter VI investigates the topic of inherent ambiguity. An algebraic necessary and sufficient condition for a bounded context-free language to be inherently ambiguous is given.  ...  Here, among other things, are proofs that the intersection of a context-free language with a regular set is a context-free language, and | that a generalized sequential machine maps a context-free | language  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1968-02_35_2/page/504" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1968-02_35_2/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 701 of Mathematical Reviews Vol. 44, Issue 3 [page]

<span title="">1972</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
A class of context-free languages with inherent direct ambiguity of infinite degree is also given. 3812 701  ...  It is shown that all the languages in a certain class of context-free languages are inherently ambiguous with unbounded degree.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1972-09_44_3/page/701" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1972-09_44_3/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

The influence of productions on derivations and parsing (Extended Abstract)

Benton L. Leong, Detlef Wotschke
<span title="">1976</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2qaxtqe2rfgjnfefqcokcnzelq" style="color: black;">Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages - POPL &#39;76</a> </i> &nbsp;
The concept of grammar forms [4,5] provides evidence that there seems to be no way to base the definitions of many grammar types used in parsing and compiling solely on the concept of productions.  ...  ACKNOWLEDGEMENT: The authors are grateful to S. Ginsburg for stimulating their interest in grammar forms. [l]  ...  Proof: To l) It is well known that there are inherently ambiguous context-free languages [Ill.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/800168.811535">doi:10.1145/800168.811535</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/popl/LeongW76.html">dblp:conf/popl/LeongW76</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fjax5al33jdjtmjih54cir2c74">fatcat:fjax5al33jdjtmjih54cir2c74</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190216131103/https://static.aminer.org/pdf/20170130/pdfs/popl/zfaeyglnmnxwqz5uqdbkphuksmbcdxty.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e7/e3/e7e36b4c8d5a24a8c3edb5c6fd0d067b69f493d1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/800168.811535"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Sublogarithmic ambiguity

Klaus Wich
<span title="">2005</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
The second one states that any ambiguity function of a cycle-free context-free grammar is an inherent ambiguity function of some context-free language. → . In this case X is called the root of .  ...  Then there is a context-free language L with a divergent inherent ambiguity function g below f , i.e., g(n) f (n) for each n ∈ N.  ...  Each ambiguity function of a cycle-free context-free grammar is inherent for some context-free language. Proof. Let G 1 be a cycle-free context-free grammar.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2005.07.024">doi:10.1016/j.tcs.2005.07.024</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lvbrv4ak45dfboxmpji4tt6fye">fatcat:lvbrv4ak45dfboxmpji4tt6fye</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190315072603/https://core.ac.uk/download/pdf/82074090.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/4e/5f/4e5fb534d6d2c4498bacc9f2e2bc965d4934db4d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2005.07.024"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

The characterization of nonexpansive grammars by rational power series

Gerd Baron, Werner Kuich
<span title="">1981</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fbkexx2qg5anljkxraobuswdq4" style="color: black;">Information and Control</a> </i> &nbsp;
The rest of the paper deals with unambiguity of context-free grammars and inherently ambiguous context-free languages.  ...  The next theorem is useful in proving context-free languages of a certain form to be inherently ambiguous. THEOREM 5.  ...  Since the languages L 1 and L 2 of Examples 2 and 3 are generated by nonexpansive context-free grammars the following theorem holds. THEOREM 6.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0019-9958(81)90634-3">doi:10.1016/s0019-9958(81)90634-3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7oqv3zvexra63dbjhthm4frroq">fatcat:7oqv3zvexra63dbjhthm4frroq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190323225914/https://core.ac.uk/download/pdf/82277896.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/74/2a/742aedcfae7f9c9d5707ac983cf5d2a407781e82.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0019-9958(81)90634-3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Page 4896 of Mathematical Reviews Vol. , Issue 88i [page]

<span title="">1988</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
By means of this transformation, a proof is presented of the fact that any cycle-free context-free grammar can be left-to-left-corner covered by a nonleft-recursive grammar.  ...  The method of proof is based on the idea to transform the characteristic grammar associated with the simple syntax-directed translation scheme which defines the left-corner parse of the strings generated  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1988-09_88i/page/4896" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1988-09_88i/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

On Parikh slender context-free languages

Juha Honkala
<span title="">2001</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
In a recent paper we deÿned 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.  ...  In particular, a new simple proof of the result of Autebert et al. [2] concerning the inherent ambiguity of copreÿx languages of inÿnite words is given.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(00)00393-5">doi:10.1016/s0304-3975(00)00393-5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rptfvqxqlbcofetape6aar5hyq">fatcat:rptfvqxqlbcofetape6aar5hyq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170927201426/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/598/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDMwNDM5NzUwMDAwMzkzNQ%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/72/f4/72f4c2bd5839021144b54134a32109947d19eca3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(00)00393-5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Remarks on arbitrary multiple pattern interpretations

Carlos Martín-Vide, Victor Mitrana
<span title="">2007</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5xfy4fcdxvcvdiybp6iqbffqc4" style="color: black;">Information Processing Letters</a> </i> &nbsp;
a context-free language is the arbitrary multiple pattern interpretation of a finite language.  ...  Proposition 1 .3. 2 12 For any k ≥ 1, HOM n (CF) ⊂ NSPACE(n). . 1 1 The Kleene closure of any arbitrary multiple pattern interpretation of a regular (context-free) language is regular (context-free).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ipl.2006.09.011">doi:10.1016/j.ipl.2006.09.011</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4cbsxze6ujfyji336nznbwy42q">fatcat:4cbsxze6ujfyji336nznbwy42q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808052908/http://wwwhomes.uni-bielefeld.de/mol/mol8/papers_mol8/mitranavide.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/37/d8/37d87f5e935becacfcf52642659d848d0506e1ce.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ipl.2006.09.011"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Unambiguous Boolean grammars

Alexander Okhotin
<span title="">2008</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/joe2ngto45hbnl3pncnesnq344" style="color: black;">Information and Computation</a> </i> &nbsp;
Consider the standard example of an inherently ambiguous context-free language: {a i b j c k | i; j; k 0, i = j or j = k}.  ...  Though no proofs of inherent ambiguity of any languages have been found so far, there is a certain evidence that both inherently ambiguous conjunctive languages and inherently ambiguous Boolean languages  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ic.2008.03.023">doi:10.1016/j.ic.2008.03.023</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xp5izq5lvfek7mop5ki2mtmzlm">fatcat:xp5izq5lvfek7mop5ki2mtmzlm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170924011821/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/0b0/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDg5MDU0MDEwODAwMDYzMQ%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/49/96/499603dbe6fbae6fefcf218b6ff553cd23172bdd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ic.2008.03.023"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

On the number of words in the language {w ε σ∗ ∣ w = wR}2

R. Kemp
<span title="">1982</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/civgv5utqzhu7aj6voo6vc5vx4" style="color: black;">Discrete Mathematics</a> </i> &nbsp;
Let S be the set of all palindromes over B *. It is well known. that the language S* is an ultralinear, inherently ambiguous context-free language.  ...  Finally, we compute an expression for the structure-generatingfunction T(S2; L) of the language S*; it remains the open problem, if TCS'; z) is a transcendental or an algebraic function.  ...  It was an open problem, if there are inherently ambiguous context-free languages with a transcendental asymptotical density.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0012-365x(82)90123-6">doi:10.1016/0012-365x(82)90123-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/l5nu3tfo6vawxbv3zuppfchdne">fatcat:l5nu3tfo6vawxbv3zuppfchdne</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190416230935/https://core.ac.uk/download/pdf/82135100.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e9/ec/e9ec7d949ae0eed5b9e7b3d78bea439876f2278e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0012-365x(82)90123-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Analyzing Ambiguity of Context-Free Grammars

Claus Brabrand, Robert Giegerich, Anders Møller
<span title="2006-05-13">2006</span> <i title="Aarhus University Library"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/433eg2tipzegfkgt5m5cmv46zq" style="color: black;">BRICS Report Series</a> </i> &nbsp;
Ambiguity in context-free grammars is a recurring problem in language design and parser generation, as well as in applications where grammars are used as models of real-world physical structures.  ...  <br /> <br />We observe that there is a simple linguistic characterization of the grammar ambiguity problem, and we show how to exploit this to conservatively approximate the problem based on local regular  ...  A Characterization of Grammar Ambiguity We begin by briefly recapitulating the basic terminology about context-free grammars. Definition 1 (Context-free grammar and ambiguity).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7146/brics.v13i9.21965">doi:10.7146/brics.v13i9.21965</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5yeara6i6ncvlpmfd3invchyui">fatcat:5yeara6i6ncvlpmfd3invchyui</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20080418213526/http://www.daimi.au.dk/~amoeller/papers/ambiguity/ambiguity.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0f/69/0f699988bc4cc720e7a4cffc3280c21560f7cdfb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7146/brics.v13i9.21965"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 35,531 results