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.
Cite
CITATION STYLE
Hartmanis, J. (1979). On the succinctness of different representations of languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 71 LNCS, pp. 282–288). Springer Verlag. https://doi.org/10.1007/3-540-09510-1_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
