go-v.orgdoi

On the Succinctness of Different Representations of Languages

Juris Hartmanis · SIAM Journal on Computing · 1980

  • DOI 10.1137/0209010
  • Publisher Society for Industrial and Applied Mathematics
  • Type article
  • Issued 1980

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

SIAM Journal on Computing · Society for Industrial and Applied Mathematics · article · 1980

Abstract

The purposes 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.

Open the resolved locator · 10.1137/0209010

Metadata licence: OpenAlex metadata (CC0)

Registry
OpenAlex DOI index + API
Fetched
2026-11-20 05:10 UTC
Cache state
not cached yet (bulk-index+openalex)
Locator
https://doi.org/10.1137/0209010
Metadata licence
OpenAlex metadata (CC0)
Scope
Metadata as returned by the resolver; abstracts are never generated here.