Cooperating Distributed Grammar Systems with Random Context Grammars as Components | Zendy

Zbyněk Křivka | Zendy; Tomáš Masopust | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Cooperating Distributed Grammar Systems with Random Context Grammars as Components

Author(s) -

Zbyněk Křivka,

Tomáš Masopust

Publication year - 2011

Publication title -

acta cybernetica

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.143

H-Index - 18

eISSN - 2676-993X

pISSN - 0324-721X

DOI - 10.14232/actacyb.20.2.2011.4

Subject(s) - computer science , context sensitive grammar , rule based machine translation , tree adjoining grammar , grammar , grammar systems theory , context free grammar , adaptive grammar , programming language , extended affix grammar , context (archaeology) , mildly context sensitive grammar formalism , l attributed grammar , natural language processing , operator precedence grammar , theoretical computer science , affix grammar , generative grammar , artificial intelligence , phrase structure rules , linguistics , paleontology , philosophy , biology

In this paper, we discuss cooperating distributed grammar systems where components are (variants of) random context grammars. We give an overview of known results and open problems, and prove some further results.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research