A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
A characterization of poly-slender context-free languages
2000
RAIRO - Theoretical Informatics and Applications
Preserved Fulltext
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 ). ...
Acknowledgements We would like to thank the anonymous referees for useful remarks concerning especially the clarity of the proof of Theorem 8 and for pointing out the references 11] and 12]. ...
doi:10.1051/ita:2000100
fatcat:u5cp7v5dancjvn6hw2rsdhf6wa
Chomsky-Schützenberger Type Characterizations of Poly-Slender and Parikh Slender Context-Free Languages1 1Work supported by the Grants-in Aid for Scientific Research No. 1 0440034, Japan Society for the Promotion of Sciences and the Dirección General de Enseñanza Superior e Investigación Cientifica, SB 97-00110508
2004
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper we propose a Chomsky-Schützenberger type characterization ofpoly-slender context-free languages, as the homomorphical image of an intersection of a Dyck language and a´¾ · ½ µ -poly-slender ...
A similar characterization is obtained for Parikh slender context-free languages. ½ ...
A characterization of poly-slender regular languages has been provided in [21] while a characterization of poly-slender context-free languages has been proposed in [12] . ...
doi:10.1016/s1571-0661(05)82579-4
fatcat:aqng5oczxffvreq64w3al6hwq4
Length considerations in context-free languages
1997
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
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 ...
Every poly-slender context-free language is bounded. Proof. ...
doi:10.1016/s0304-3975(96)00308-8
fatcat:bcsghpe6vrflfd262icx6kzije
Recognition of Linear-Slender Context-Free Languages by Real Time One-Way Cellular Automata
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A linear-slender context-free language is a context-free language whose number of words of length n is linear in n. ...
Thanks to this characterization, we show that every linear-slender context-free language is recognizable by a real time one-way cellular automaton. ...
A context-free language is poly-slender if and only if it is bounded. ...
doi:10.1007/978-3-662-47221-7_19
fatcat:jnzhmozvwrg7xj5s5rto4ecuja
Page 2882 of Mathematical Reviews Vol. , Issue 2003d
[page]
2003
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
We give a characterization of Parikh k-poly-slender context-free languages and prove the decidability of both k-poly-slenderness and Parikh k-poly-slenderness for context-free languages.” ...
20034:68121
of length n in L is of order O(n*) and Parikh k-poly-slender if the number of words with the same Parikh vector is of order O(n*). ...
Page 5019 of Mathematical Reviews Vol. , Issue 2001G
[page]
2001
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
of poly-slender context-free languages. ...
The authors show that for any k > 0, a context-free language L is k-poly-slender if and only if L equals a finite union of (k + 1)-Dyck loops. ...
On Parikh Slender Languages and Power Series
1996
Journal of computer and system sciences (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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. ...
The characterization of Parikh slender context-free languages among the bounded languages is an open problem. ...
doi:10.1006/jcss.1996.0014
fatcat:4q5xjwiecrdobnuwbsp26xll3q
Page 8659 of Mathematical Reviews Vol. , Issue 2003k
[page]
2003
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
For any alpha- bet , another alphabet A, a homomorphism hh: A* — =* and a Dyck language D over A can be determined such that for every poly-slender context-free language L over 2, a poly-slender regular ...
Summary: “This paper provides the following homomorphic char- acterization of poly-slender context-free languages. ...
On the equivalence problem of context-free and DT0L languages
1999
Discrete Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It is undecidable whether or not a given context-free language and a propagating DT0L language are equal. ...
We show that equivalence is decidable between context-free and everywhere growing DT0L languages. ? ...
The following theorem gives a characterization of sparse context-free languages due to Latteux and Thierrin [6] . ...
doi:10.1016/s0166-218x(99)00120-1
fatcat:g2igpplvhrc6lm7csafrjvjchy
Some Computational Limits of Trellis Automata
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Reusing a counting argument introduced in [4], we show that: {x1 . . . xny1 . . . yn : xiyi ∈ {ab, ba, bb} for i = 1, . . . , n} is not a trellis language. ...
We investigate some computational limits of trellis automata. ...
In this regard, the linear context free, the visible pushdown, the poly-slender context free languages are known to be all recognized by trellis automata [2, 6, 8, 1, 11] . ...
doi:10.1007/978-3-319-58631-1_14
fatcat:qdqk2eujpbechjlgfhy2ynfmve
Finding the growth rate of a regular language in polynomial time
[article]
2007
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We also show that given a DFA accepting a language of polynomial growth, we can determine the order of polynomial growth in quadratic time. ...
We give an O(n^3+n^2 t) time algorithm to determine whether an NFA with n states and t transitions accepts a language of polynomial or exponential growth. ...
Acknowledgments We would like to thank Arne Storjohann for his input regarding algorithms for computing the Perron-Frobenius eigenvalue of a nonnegative integer matrix. ...
arXiv:0711.4990v1
fatcat:hn5wzy4aojc6rmg3773tedyv6e
Shuffle on trajectories: Syntactic constraints
1998
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
For instance, we provide examples of applications to fairness property and to parallelization of non-context-free languages in terms of context-free and even regular languages. ...
We introduce and investigate new methods to define parallel composition of words and languages as well as of w-words and o-languages. ...
(ii) Using (i), we conclude that T is a context-free langnage that is also poly-slender. Therefore, from [39] , it follows that T is a bounded language. q Comment. ...
doi:10.1016/s0304-3975(97)00163-1
fatcat:dqepdv4ji5fjpnlkpr2gbcihr4
West African Polyrhythm: culture, theory, and representation
2021
SHS Web of Conferences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
well-known but culturally biased Western notation; a more neutral tabular notation, widely used in ethnomusicology but more limited in its representation of structure; and a context-free recursive grammar ...
In this paper I explicate polyrhythm in the context of traditional West African music, framing it within a more general theory of polyrhythm and polymeter, then compare three approaches for the visual ...
Understanding that system is thus a means of understanding society, as well as its music. ...
doi:10.1051/shsconf/202110205001
fatcat:dtn46kk2ofadrawnpvaw2ig2dq
Classical Greek Ethnography and the Slave Trade
2019
Classical Antiquity
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
previous Versions of this paper have been delivered at the History Department of Lancaster University, a joint St Andrews and William and Mary College symposium, and a Cambridge teachers' conference organized ...
fostering a discourse on the differences among foreign peoples; and secondly, that Greek ethnographic writing was informed by the experience of slavery, containing implicit justifications of slavery as ...
Hansen's verdict, 2006: 109, on the numbers of free non-citizens and slaves: "Every polis had plenty of both." ...
doi:10.1525/ca.2019.38.1.36
fatcat:4tfpmimg2vfjdiod67dk56pdle
Foucault Goes to Weight Watchers
2006
Hypatia
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
The hupomnemata of these organizations thus use asketic language to conceal their implication in normalization. ...
time as they encourage participation in ever-tightening webs of power. ...
context. ...
doi:10.1111/j.1527-2001.2006.tb01097.x
fatcat:f6rykj2ajvhbraxuga3evjplta
« Previous
Showing results 1 — 15 out of 558 results