The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Filters
Descriptional complexity of bounded context-free languages
[article]
2009
arXiv
pre-print
Preserved Fulltext
Other Versions
Finite-turn pushdown automata (PDA) are investigated concerning their descriptional complexity. It is known that they accept exactly the class of ultralinear context-free languages. ...
Finally, the more general case of word-bounded languages is investigated. We show how the results obtained for letter-bounded languages can be extended to word-bounded languages. ...
Since the membership problem for word-bounded context-free languages can be reduced to the membership problem for letter-bounded context-free languages by using suitable inverse homomorphisms, we obtain ...
arXiv:0905.1045v2
fatcat:yxmqfio575cyvbtlv2sxgdo4ri
Page 7067 of Mathematical Reviews Vol. , Issue 2003i
[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.
; Waterloo, ON)
Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. ...
This paper studies the size, or the descriptive complexity, of context-free grammars, finite automata, and (auxiliary) pushdown automata, from the point of view of how complex are unary languages, i.e. ...
On the recursion-theoretic complexity of relative succinctness of representations of languages
1982
Information and Control
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.
Exactly analogous results hold for the complexity of the relative succinctness of the representation of unambiguous context-free languages by unambiguous and ambiguous context-free grammars (Schmidt and ...
It will be shown that for the examples considered in Hartmanis (1980) (deterministic context-free languages, unambiguous languages, regular languages), the best possible partial bound as a function of ...
doi:10.1016/s0019-9958(82)80081-8
fatcat:q5ongxuuzbagnppverwjq2wmam
Page 1356 of Mathematical Reviews Vol. 53, Issue 4
[page]
1977
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.
This paper is a survey of the descriptional (e.g., grammar, auto- 7
mata and expression) complexity of context-free languages. ...
Gruska, Josef Descriptional complexity of context-free languages. Mathematical foundations of computer science (Proc. Sympos. and Summer School, Strbské Pleso, 1973), pp. 71-83. Math. ...
On Measuring Non-Recursive Trade-Offs
2009
Electronic Proceedings 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 2009; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We also identify criteria which, in the spirit of abstract language theory, allow us to deduce non-recursive tradeoffs from effective closure properties of language families on the one hand, and differences ...
We investigate the phenomenon of non-recursive trade-offs between descriptional systems in an abstract fashion. ...
context-sensitive grammars and ET0L systems, (VII) between context-sensitive grammars and (linear) context-free grammars, and (VIII) between context-sensitive grammars and indexed grammars. ...
doi:10.4204/eptcs.3.13
fatcat:iwyn6aly6zbslj2qxx6kzf2u4m
Cumulative subject index
1978
Information and Control
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.
bounded
languages, 39, 177
forms, context-free: context-senaitive
languages and, 39, 135
families of, effect of finite index restric-
tion on, 39, 284
finite-index, family of languages with
only ...
, 39, 14
graph, context-free, 37, 207
stochastic regular, inference of, 38, 310
universal and left universal, and context-
sensitive languages, 39, 135
Graph
grammars, context-free, 37, 207
theory ...
doi:10.1016/s0019-9958(78)90707-6
fatcat:3g6qa5hi2zc2lgyyvndbar65di
Page 6510 of Mathematical Reviews Vol. , Issue 98J
[page]
1998
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.
Moreover, we show that conditional context-free languages with context-free conditions of finite index are more powerful than conditional context-free languages with regular conditions of fi- nite index ...
Tiibingen) Conditional context-free languages of finite index. ...
Page 1006 of Mathematical Reviews Vol. 56, Issue 3
[page]
1978
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.
the same complexity) for any other context-free language. ...
After a section with some known results in the area of bounded languages, the author makes a study of the inclusion relations among some families of context-free bounded languages. ...
A simplified lower bound for context-free-language recognition
1986
Information and Control
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 on-line recognition of the words in an arbitrary linear context-free language, there are known tight bounds on the time required by a deterministic multitape Turing machine. ...
Using Kolmogorov's notion of descriptional complexity as a tool, we present a simple proof of the latter result. © 1986 Academic Press, Inc. where w R denotes the reverse of word w. ...
For on-line recognition of the words in an arbitrary linear context-free language (Harrison, 1978) , there are known tight bounds on the time required by a deterministic multitape Turing machine. ...
doi:10.1016/s0019-9958(86)80048-1
fatcat:22ukzllhlfgwfmojobrognj3yq
Page 1307 of Mathematical Reviews Vol. , Issue 2003B
[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.
It turns out that the family of counter synchronized context-free languages is a proper superset of the family of context-free languages and is strictly contained in the family of synchronized context-free ...
In this representation, bound variables of the object language are represented by bound variables of the metalanguage. ...
On the descriptional power of heads, counters, and pebbles
2005
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.
We investigate the descriptional complexity of deterministic two-way k-head finite automata (k-DHA). ...
An immediate consequence of the previous theorems are non-recursive trade-offs between the languages accepted by any k-DHA, k 2, and the context-free languages. Theorem 5. ...
Since the context-free languages are a subset of P, the complexity classes DSPACE(log) and P would be separated. ...
doi:10.1016/j.tcs.2004.04.013
fatcat:u2nr4t3twzcubmfoyhfqcn7iwa
Regular realizability problems and context-free languages
[article]
2015
arXiv
pre-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 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this paper we focus on the case of context-free filters. Algorithmic complexity of the RR problem is a very coarse measure of context-free languages complexity. ...
We present examples of P-complete RR problems as well as examples of RR problems in the class NL. Also we discuss RR problems with context-free filters that might have intermediate complexity. ...
Acknowledgments We are acknowledged to Abuzer Yakaryilmaz for pointing on the result of Lemma 5 and for reference to a lemma similar to Lemma 6. ...
arXiv:1503.00295v2
fatcat:7gjxwtmwx5fdfglgz6vyfun7fy
Page 1883 of Mathematical Reviews Vol. 55, Issue 6
[page]
1978
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.
, -++,L, are context-free languages one of which is bounded,
then L; N---OL, is an EDTOL language. (4) The complement
of any intersection of bounded context-free languages is an
EDTOL language. ...
The present author adds four intricate and complex results on iterative pairs in context-free languages. ...
Page 2252 of Mathematical Reviews Vol. 52, Issue 6
[page]
1976
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 languages L in #,, is description in 9 more “economical” than description in J, and if so by how much? ...
In this paper, is the family of context-free grammars and 9, is the family of context-free grammars without erasing rules; as is well known, Y,={L—{empty word}|L ¢ #}. ...
Page 3793 of Mathematical Reviews Vol. , Issue 84i
[page]
1984
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.
Author’s summary: “Derivational complexity of context-free grammars is studied. ...
Further, we give the integral description of the replacement property of a family of languages. ...
« Previous
Showing results 1 — 15 out of 199,178 results