| Articolul precedent |
| Articolul urmator |
 |
 381 0 |
 SM ISO690:2012ALHAZOV, Artiom, FREUND, Rudolf, IVANOV, Sergiu. Sequential grammars with activation and blocking of rules. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 28-30 iunie 2018, Fontainebleau. Dusseldorf, Germania: Springer Verlag, 2018, Vol. 10881 Ed. a 8-a, pp. 51-68. ISBN 978-331992401-4. ISSN 03029743. DOI: https://doi.org/10.1007/978-3-319-92402-1_3 |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 10881 Ed. a 8-a, 2018 |
||||||
|
Conferința "8th International Conference on Machines, Computations, and Universality" Fontainebleau, Franța, 28-30 iunie 2018 | ||||||
|
||||||
| DOI:https://doi.org/10.1007/978-3-319-92402-1_3 | ||||||
| Pag. 51-68 | ||||||
|
||||||
| Vezi articolul | ||||||
| Rezumat | ||||||
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. |
||||||
| Cuvinte-cheie Context free grammars, microcontrollers |
||||||
|
|
|
|
