Algebra, Grammars, and Computation

  • Alexander Meduna
  • Ondřej Soukup


In terms of algebra, the context-free and E0L grammatical derivations are traditionally defined over the free monoids generated by total alphabets of these grammars under the operation of concatenation. The present chapter, however, introduces and investigates these derivations over different algebraic structures in order to increase the generative power of these grammars.


  1. [Med90a]
    A. Meduna, Context free derivations on word monoids. Acta Informatica 27, 781–786 (1990)MathSciNetCrossRefMATHGoogle Scholar
  2. [Med95b]
    A. Meduna, Syntactic complexity of scattered context grammars. Acta Informatica 32, 285–298 (1995)MathSciNetCrossRefMATHGoogle Scholar
  3. [MK02]
    A. Meduna, D. Kolář, Homogenous grammars with a reduced number of non-context-free productions. Inf. Process. Lett. 81, 253–257 (2002)CrossRefMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Alexander Meduna
    • 1
  • Ondřej Soukup
    • 2
  1. 1.Department of Computer ScienceBrno University of TechnologyBrnoCzech Republic
  2. 2.Department of Information TechnologyBrno University of TechnologyBrnoCzech Republic

Personalised recommendations