Abstract
Non-uniform complexity measures arising in Automata and Formal Language Theory are characterized in terms of well-known uniform complexity classes. The initial index of languages is introduced by means of several computational models. It is shown to be closely related to context-free cost, boolean circuits, straight line programs, and Turing machines with sparse oracles and time or space bounds.
This work has been partially supported by CIRIT, DOG 486.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Aanderaa, E. Börger: The equivalence of Horn and network complexity for boolean functions. Acta Informatica 15 (1981), 303–307.
L. Berman, J. Hartmanis: On isomorphism and density of NP and other complete sets, SIAM J. Comp 6 (1977), 305–322.
A. Borodin, I. Munro: The computational complexity of algebraic and numeric problems. American Elsivier (1975).
F. Brandenburg: On one-way auxiliary pushdown automata, 3rd GI conf. Theor. Comp. Sci. (1977), LNCS 48 132–144.
W. Bucher, K. Culik, H. Maurer, D. Wotschke: Concise description of finite languages. TCS 14 (1981), 227–246.
M. Chytil: Almost context-free languages. Manuscript (1984).
S. Cook: Characterizations of pushdown machines in terms of time-bounded computers. J. ACM 18 (1971), 4–18.
J. Gabarró: Initial index: a new complexity function for languages. ICALP 83, 226–236.
G. Goodrich, R. Ladner, M. Fischer: Straight line programs to compute finite languages. Conf. on Theor. Comp. Sci., Waterloo (1977).
S. Greibach: Remarks on the complexity of nondeterministic counter languages. TCS 1 (1976), 269–288.
J. Hartmanis, P. Lewis, R. Stearns: Classification of computations by time and memory requirements. Proc. IFIP Cont. 65, 1, 31–35 (1965).
J. Hopcroft, J. Ullman: Some results on tape-bounded Turing machines, J. ACM 3 (1969), 168–177.
O. Lupanov: A method of circuit synthesis, Izv. V.U.Z. Radiof., 1 (1958), 120–140.
N. Lynch: Log space recognition and translation of parenthesis languages, J. ACM 24 (1977), 583–590.
J. Savage: The complexity of computing, Wiley Interscience (1976).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balcázar, J.L., Díaz, J., Gabarró, J. (1985). On some "non-uniform" complexity measures. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028787
Download citation
DOI: https://doi.org/10.1007/BFb0028787
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15689-5
Online ISBN: 978-3-540-39636-9
eBook Packages: Springer Book Archive