Fred G. Abramson
- 1 BARZDIN, Y.M. The complexity of programs recognizing finite subsets of recursively enumerable sets. Doklady Akad. Nauk 182 (1968), 1249-1252 (in Russian).Google Scholar
- 2 BREITBART, Y., Arid LEWIS, F.D. Time-size tradeoffs for complete undecidable problems. Proc. 1978 Johns Hopkins Conf. on Information Sciences and Systems, Baltimore, Md., 1978.Google Scholar
- 3 BREITBART, Y. Combined complexity classes for finite functions. R.A.LR.O. Informatique Theorique 13, 1 (1979), 88-97.Google Scholar
- 4 CHArrlN, G.J. On the length of programs for computing finite binary sequences. ~ A CM 13, 4 (Oct. 1966), 547-569. Google Scholar
- 5 CHAITIN, G.J. A theory ofprogram size formally identical to information theory. J. ACM 22, 3 (July 1975), 329-340. Google Scholar
- 6 DALEY, R. Minimal program complexity of sequences with restricted resources. Inform. and Control 23 (1973), 301-312.Google Scholar
- 7 DALEY, R. An example of information and computation resource trade-off. J. ACM 20, 4 (Oct. 1973), 687- 695. Google Scholar
- 8 DALEY, R. On the inference of optimal descriptions. Theoret. Comptr. ScL 4 (1977), 301-319.Google Scholar
- 9 EnRESFEUCHT, A. Practical decidability. J. Comptr. Syst. Sci. 11 (1975), 392-396.Google Scholar
- 10 FLEISCHMANN, K., MAHR, B., AND SIEPKES, D. Bounded concatenation as a uniform method for proving lower complexity bounds. In Oxford Logic Colloquium 76, Studies in Logic and the Foundations of Mathematics, Vol. 87, North-Holland, Amsterdam, 1977, pp. 471-490.Google Scholar
- 11 HOPCROFr, J.E., AND ULLMAN, J.D. Formal Languages and Their Relation to Automata. Addison-Wesley, Reading, Mass., 1969. Google Scholar
- 12 KANOVlCH, M.A., AND PETRI, N. Some theorems about complexity of normal algorithms and computations. Doklady Akad. Nauk 187, 6 (1969), 1257-1259 (in Russian).Google Scholar
- 13 KOLMOGOROF, A. On three approaches to definition of the notion "'quantity of information." Problemy Peredachi Informatii 3, 3 (1965), 3-7.Google Scholar
- 14 KUZMIN, V. Evaluation of Boolean functions by finite automata, normal algorithms and Turing machines. Prob. of Cybernet. 13 (1965), 75-96 (in Russian).Google Scholar
- 15 LUPANOV, O.B. A method of circuit synthesis, lzv. V.U.Z. Radiofiz 1, l (1958), 120-140 (in Russian).Google Scholar
- 16 PErRI, N. On algorithms related to predicates and Boolean functions. Doklady Acad. Nauk 185 (1969), 37- 39 (in Russian).Google Scholar
- 17 ROGERS, H. JR. Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York, 1967. Google Scholar
- 18 SAVAGE, J.E. The Complexity of Computing. Wiley, New York, 1976. Google Scholar
Index Terms
- Complex Properties of Grammars
Recommendations
Some computational properties of tree adjoining grammars
HLT '86: Proceedings of the workshop on Strategic computing natural languageTree Adjoining Grammar (TAG) is a formalism for natural language grammars. Some of the basic notions of TAG's were introduced in [Joshi, Levy, and Takahashi 1975] and by [Joshi, 1983]. A detailed investigation of the linguistic relevance of TAG's has ...
Some Preservation Properties of Normal Form Grammars
The normal form grammars, such as those developed by Chomsky and Greibach, preserve certain properties of the original grammar. Ordinarily attention is only directed to weak equivalence, that is, that the original grammar and its normal form version both ...
Some computational properties of Tree Adjoining Grammars
ACL '85: Proceedings of the 23rd annual meeting on Association for Computational LinguisticsTree Adjoining Grammar (TAG) is a formalism for natural language grammars. Some of the basic notions of TAG's were introduced in [Joshi, Levy, and Takahashi 1975] and by [Joshi, 1983]. A detailed investigation of the linguistic relevance of TAG's has ...
Comments