A Short Comment on Controlled Context-Free Grammar Derivations

Kurzanzeige
dc.contributor.authorHolzer, Markus
dc.date.accessioned2024-07-15T05:30:06Z
dc.date.available2024-07-15T05:30:06Z
dc.date.issued2024-07-04
dc.description.abstractWe 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.
dc.identifier.urihttps://jlupub.ub.uni-giessen.de/handle/jlupub/19322
dc.identifier.urihttps://doi.org/10.22029/jlupub-18682
dc.language.isoen
dc.relation.ispartofseriesIFIG Research Report; 2402
dc.rightsIn Copyright*
dc.rights.urihttp://rightsstatements.org/page/InC/1.0/*
dc.subjectContext-Free Grammars
dc.subjectControlled Derivation
dc.subjectOrdered Languages
dc.subjectMatrix Grammars and Languages
dc.subject.ddcddc:004
dc.titleA Short Comment on Controlled Context-Free Grammar Derivations
dc.typeworkingPaper
local.affiliationFB 07 - Mathematik und Informatik, Physik, Geographie

Dateien

Originalbündel
Gerade angezeigt 1 - 1 von 1
Vorschaubild
Name:
IFIG-Report2402.pdf
Größe:
1.32 MB
Format:
Adobe Portable Document Format
Herunterladen
Lizenzbündel
Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
license.txt
Größe:
7.58 KB
Format:
Item-specific license agreed upon to submission
Beschreibung:
Herunterladen

Sammlungen

IFIG Research Report