Abstract
The purpose of this paper is to give simple new proofs of some interesting recent results about the relative succinctness of different representations of regular, deterministic and unambiguous context-free languages and to derive some new results about how the relative succinctness of representations change when the representations contain a formal proof that the languages generated are in the desired subclass of languages.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This research has been supported in part by National Science Foundation Grants DCR75-09433 and MCS 78-00418.
Preview
Unable to display preview. Download preview PDF.
References
Blum, M. "On the Size of Machines", Information and Control, Vol. 11 (1967), 257–265.
Hartmanis, J. "Context-Free Languages and Turing Machine Computations", Proceedings of Symposia in Applied Mathematics, Vol. 19, Mathematical Aspects of Computer Science, pp. 42–51, Amer. Math. Soc. 1967.
Meyer, A.R. and M.J. Fischer. "Economy of Description by Automata, Grammars and Formal Systems", Conference Record, IEEE 12th Annual Symposium on Switching and Automata Theory (1971), 188–190.
Reedy, H. and W.J. Savitch. "The Turing Degree of the Inherent Ambiguity Problem for Context-Free Languages", Theoretical Computer Science, Vol. 1 (1975), 77–91.
Schmidt, E.H. and T.G. Szymanski. "Succinctness of Descriptions of Unambiguous Context-Free Languages", SIAM J. Computing, Vol. 6 (1977), 547–553.
Valiant, L.G. "A Note on the Succinctness of Descriptions of Deterministic Languages", Information and Control, Vol. 32 (1976), 139–145.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hartmanis, J. (1979). On the succinctness of different representations of languages. In: Maurer, H.A. (eds) Automata, Languages and Programming. ICALP 1979. Lecture Notes in Computer Science, vol 71. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09510-1_22
Download citation
DOI: https://doi.org/10.1007/3-540-09510-1_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09510-1
Online ISBN: 978-3-540-35168-9
eBook Packages: Springer Book Archive