On the Grammatical Complexity of Finite Languages

  • Markus HolzerEmail author
  • Simon Wolfsteiner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10952)


We study the grammatical production complexity of finite languages w.r.t. (i) different interpretations of approximation, i.e., equivalence, cover, and scattered cover, and (ii) whether the underlying grammar generates a finite or infinite language. In case the generated language is infinite, the intersection with all words up to a certain length has to be considered in order to obtain the finite language under consideration. In this way, we obtain six different measures for regular, linear context-free, and context-free grammars. We compare these measures according to the taxonomy introduced in [J. Dassow, Gh. Păun: Regulated Rewriting in Formal Language Theory, 1989] with each other by fixing the grammar type and varying the complexity measure and the other way around, that is, by fixing the complexity measure and varying the grammar type. In both of these cases, we develop an almost complete picture, which gives new and interesting insights into the old topic of grammatical production complexity.


  1. 1.
    Blum, N., Koch, R.: Greibach normal form transformation revisited. Inform. Comput. 150(1), 112–118 (1999)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Bucher, W.: A note on a problem in the theory of grammatical complexity. Theoret. Comput. Sci. 14(3), 337–344 (1981)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Bucher, W., Maurer, H.A., Culik II, K.: Context-free complexity of finite languages. Theoret. Comput. Sci. 28(3), 277–285 (1983)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Bucher, W., Maurer, H.A., Culik II, K., Wotschke, D.: Concise description of finite languages. Theoret. Comput. Sci. 14(3), 227–246 (1981)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Câmpeanu, C., Sântean, N., Yu, S.: Minimal cover-automata for finite languages. Theoret. Comput. Sci. 267(1–2), 3–16 (2001)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Dassow, J., Păun, Gh.: Regulated Rewriting in Formal Language Theory. EATCS Monographs in Theoretical Computer Science, vol. 18. Springer, Heidelberg (1989)CrossRefGoogle Scholar
  7. 7.
    Eberhard, S., Hetzl, S.: On the compressibility of finite languages and formal proofs. Inform. Comput. 259(2), 191–213 (2018)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Hetzl, S., Wolfsteiner, S.: Cover complexity of finite languages. In: Konstantinidis, S., Pighizzini, G. (eds.) DCFS 2018. LNCS, vol. 10952, pp. 139–150. Springer, Cham (2018)Google Scholar
  9. 9.
    Gruber, H., Holzer, M., Wolfsteiner, S.: On Minimal Grammar Problems for Finite Languages (2018, Submitted for publication)Google Scholar
  10. 10.
    Wood, D.: Theory of Computation. Wiley, New York (1987)zbMATHGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2018

Authors and Affiliations

  1. 1.Institut für InformatikUniversität GiessenGiessenGermany
  2. 2.Institut für Diskrete Mathematik und GeometrieTU WienWienAustria

Personalised recommendations