Zur Kurzanzeige

dc.date.accessioned2007-11-07T12:22:02Z
dc.date.available2007-11-07T12:22:02Z
dc.date.issued2007-11-07T12:22:02Z
dc.identifier.uriurn:nbn:de:hebis:34-2007110719587
dc.identifier.urihttp://hdl.handle.net/123456789/2007110719587
dc.description.sponsorshipDie Arbeit von Herrn Prof. Dr. Etsuro Moriya wurde durch einen Grant der Waseda University, Tokio, gefördert (Waseda University Grant for Special Research Projects #2006B-073).ger
dc.format.extent232627 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.rightsUrheberrechtlich geschützt
dc.rights.urihttps://rightsstatements.org/page/InC/1.0/
dc.subjectGrammareng
dc.subjectAlternationeng
dc.subjectAlternating context-sensitive grammareng
dc.subjectAlternating phrase-structure grammareng
dc.subjectState-alternating grammareng
dc.subjectLeftmost derivationeng
dc.subjectLanguage classeng
dc.subjectAlternating pushdown automatoneng
dc.subjectAlternating linear bounded automatoneng
dc.subject.ddc004
dc.titleOn Alternating Non-Context-Free Grammarseng
dc.typeTechnischer Report
dcterms.abstractWe study several extensions of the notion of alternation from context-free grammars to context-sensitive and arbitrary phrase-structure grammars. Thereby new grammatical characterizations are obtained for the class of languages that are accepted by alternating pushdown automata.eng
dcterms.accessRightsopen access
dcterms.creatorMoriya, Etsuro
dcterms.creatorOtto, Friedrich
dcterms.isPartOfKasseler Informatikschriften ;; 2007, 6ger
dc.description.everythingDie Arbeit entstand zu wesentlichen Teilen während eines Aufenthaltes von Herrn Prof. Dr. Etsuro Moriya im September 2007 in Kassel.ger
dc.subject.ccsF.1.2
dc.subject.ccsF.4.2
dc.subject.ccsF.4.3
dcterms.source.seriesKasseler Informatikschriftenger
dcterms.source.volume2007, 6ger


Dateien zu dieser Ressource

Thumbnail

Das Dokument erscheint in:

Zur Kurzanzeige