Dissecting Power of Certain Matrix Languages
| Autor: | J. Julie, V. Masilamani, J. Baskar Babujee |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Pure mathematics
Computer science String (computer science) MathematicsofComputing_NUMERICALANALYSIS Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing) Extension (predicate logic) Power (physics) Algebra Matrix (mathematics) Rule-based machine translation Regular language Theory of computing Formal language Computer Science::Programming Languages |
| Zdroj: | Theoretical Computer Science and Discrete Mathematics ISBN: 9783319644189 ICTCSDM |
| Popis: | In formal language theory, the Siromoney matrix grammars generate matrix languages. They are two dimensional languages which are \(m \times n\) arrays of terminals. In string languages, the ability of a regular language to dissect an infinite language into two partitions of infinite size has already been studied under the dissecting power of regular languages. In this paper we extend this special dissecting capacity of certain classes of string languages to matrix languages. The results demonstrate the matrix dissectibility of certain classes of matrix languages like infinite recursive matrix languages, constantly growing matrix languages (CGML), languages that are not CGML immune and CF:CF Siromoney matrix languages. In this paper the objectives of the study, extension methodology and results are discussed in detail. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|