Rewriting P Systems with Flat-Splicing Rules
| Autor: | K. G. Subramanian, Bosheng Song, Linqiang Pan |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Theoretical computer science
Chomsky hierarchy Computer science 05 social sciences 050301 education ComputerApplications_COMPUTERSINOTHERSYSTEMS 0102 computer and information sciences Prefix grammar Quantitative Biology::Genomics 01 natural sciences ComputingMethodologies_PATTERNRECOGNITION TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES 010201 computation theory & mathematics Computer Science::Logic in Computer Science Confluence RNA splicing Computer Science::Programming Languages Rewriting Bio-inspired computing 0503 education Membrane computing P system |
| Zdroj: | Membrane Computing ISBN: 9783319540719 Int. Conf. on Membrane Computing |
| DOI: | 10.1007/978-3-319-54072-6_21 |
| Popis: | Rewriting P systems, as language generating devices, are one of the earliest classes of P systems with structured strings as objects and the rewriting rules as evolution rules. Flat splicing is an operation on strings, inspired by a splicing operation on circular strings. In this work, we consider a variant of rewriting P systems with only regular or linear rewriting rules and alphabetic flat splicing rules, and the language generative power of rewriting P systems with flat splicing rules in comparison with flat splicing systems and Chomsky hierarchy is investigated. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|