On permutation languages

A tétel rövid nézete
dc.contributor.advisorNagy, Benedek
dc.contributor.authorAngyal, Dávid
dc.contributor.departmentDE--Informatikai Karhu_HU
dc.date.accessioned2014-05-05T07:50:34Z
dc.date.available2014-05-05T07:50:34Z
dc.date.created2014-05-05
dc.date.issued2014-05-05T07:50:34Z
dc.description.abstractIn this thesis we investigate some interesting properties of the family of permutation languages and its subclasses. Permutation grammars are context-free grammars extended with special non-context-free rules: permutation rules. Permutation rules have a sequence of nonterminal symbols on the left-hand side and a permutation of that sequence on the right-hand side. The simplest permutation rules are of the form AB -> BA, more complex permutation rules can be obtained by length increase, for instance ABC -> CAB. We discuss some of the subclasses of permutation grammars. We also introduce a modification to Earley's parser algorithm for context-free grammars in order to handle Perm(2, 1) grammars and discuss an efficient implementation.hu_HU
dc.description.courseprogramtervező informatikushu_HU
dc.description.degreeMSc/MAhu_HU
dc.format.extent41hu_HU
dc.identifier.urihttp://hdl.handle.net/2437/191126
dc.language.isoenhu_HU
dc.subjectformal languageshu_HU
dc.subjectpermutation languageshu_HU
dc.subjectparsinghu_HU
dc.subject.dspaceDEENK Témalista::Informatika::Számítógéptudományhu_HU
dc.titleOn permutation languageshu_HU
Fájlok
Gyűjtemények
Hallgatói dolgozatok (Informatikai Kar)