Holzer, MarkusMarkusHolzer2024-07-152024-07-152024-07-04https://jlupub.ub.uni-giessen.de/handle/jlupub/19322https://doi.org/10.22029/jlupub-18682We prove that the family of languages generated by regularly controlled grammars with control languages accepted by ordered automata is equal to the family of languages generated by matrix grammars. To our knowledge, this equivalence has been overlooked in the literature.enIn CopyrightContext-Free GrammarsControlled DerivationOrdered LanguagesMatrix Grammars and Languagesddc:004