Length of Descriptions of Languages

A Note on the Succintness of descriptions of Deterministic Languages by Valiant. Unambigous CFLs vs DPDAs

A Regularity Test for Pushdown Machines by Stearns. Reg vs DPDA

On the succintness of different represenatsions of languages by Hartmanis. Reg, DPDA, Unambig CFL

On the Recursion-Theoretic Complexity of Relative Succintness of Representations of Languages by Hay. Partial Recursive versions of REG vs CFG

Succintness of the complement and intersection of reg expressios by Gelade and Neven

Economy of descrption by automata, grammars, and formal systems by Meyer and Fischer

Complexity Measures for Regular Expressions by Ehrenfeuch and Zeiger

Succintness of Regular Expressions with Interleaving, Intersection and Counting by Gelade

Lower bound on Context-Free Grammars

On the sizes of DPDAs, PDAs, LBAs by Beigel and Gasarch