First Page | Document Content | |
---|---|---|
![]() Date: 2003-05-12 08:23:04Theoretical computer science Controlled grammar Context-free grammar Formal grammar Regulated rewriting Linear grammar Context-sensitive grammar Matrix grammar Indexed grammar Formal languages Linguistics Logic | Source URL: theo.cs.uni-magdeburg.deDownload Document from Source WebsiteFile Size: 239,06 KBShare Document on Facebook |
![]() | 24. Theorietag „Automaten und Formale Sprachen“ Caputh, 23. – 25. September 2014 Henning Bordihn, Bianca Truthe (Hrsg.)DocID: 1rsDZ - View Document |
![]() | 1 Chomsky Hierarchy Grammars for each taskDocID: 1rf0u - View Document |
![]() | Towards more complex grammar systems Some basic formal language theoryDocID: 1qSb7 - View Document |
![]() | CONSENSUS GAME ACCEPTORS AND ITERATED TRANSDUCTIONS DIETMAR BERWANGER AND MARIE VAN DEN BOGAARD LSV, CNRS and Universit´e Paris-Saclay, France Abstract. We study a game for recognising formal languages, in whichDocID: 1qMOd - View Document |
![]() | Formal Grammars and Languages 1 Tao JiangDocID: 1qE1D - View Document |