On the succinctness of different representations of languages
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.
KeywordsTuring Machine Recursive Function Finite Automaton Finite Alphabet Pushdown Automaton
Unable to display preview. Download preview PDF.
- Blum, M. "On the Size of Machines", Information and Control, Vol. 11 (1967), 257–265.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- Schmidt, E.H. and T.G. Szymanski. "Succinctness of Descriptions of Unambiguous Context-Free Languages", SIAM J. Computing, Vol. 6 (1977), 547–553.Google Scholar
- Valiant, L.G. "A Note on the Succinctness of Descriptions of Deterministic Languages", Information and Control, Vol. 32 (1976), 139–145.Google Scholar