Sequential grammars with activation and blocking of rules

Artiom Alhazov 1 Rudolf Freund 2 Sergiu Ivanov 3
1 Institute of Mathematics and Computer Science
2 Faculty of Informatics
3 IBISC - Informatique, Biologie Intégrative et Systèmes Complexes
Abstract : We introduce new possibilities to control the application of rules based on the preceding application of rules which can be defined for a general model of sequential grammars and we show some similarities with other control mechanisms such as graph-controlled grammars and matrix grammars with and without appearance checking, as well as grammars with random context conditions. Using both activation and blocking of rules, in the string and in the multiset case we can show computational completeness of context-free grammars equipped with the control mechanism of activation and blocking of rules even when using only two nonterminal symbols. With one- and two-dimensional # -context-free array grammars, computational completeness can already be obtained by only using activation of rules.
Document type :
Conference papers
Complete list of metadatas
https://hal.archives-ouvertes.fr/hal-01825162
Contributor : Frédéric Davesne <>
Submitted on : Thursday, June 28, 2018 - 10:13:04 AM
Last modification on : Friday, November 29, 2019 - 2:28:02 PM

Identifiers

Collections

UNIV-EVRY | IBISC | IBISC-COSMO | UNIV-PARIS-SACLAY

Citation

Artiom Alhazov, Rudolf Freund, Sergiu Ivanov. Sequential grammars with activation and blocking of rules. 8th International Conference on Machines, Computations, and Universality (MCU 2018), Jun 2018, Fontainebleau, France. pp.51--68, ⟨10.1007/978-3-319-92402-1_3⟩. ⟨hal-01825162⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

88

Contact

Informations

CCSD