Počet záznamů: 1
On Restricted Context-Free Grammars
- 1.
SYSNO ASEP 0346738 Druh ASEP C - Konferenční příspěvek (mezinárodní konf.) Zařazení RIV D - Článek ve sborníku Název On Restricted Context-Free Grammars Tvůrce(i) Dassow, J. (DE)
Masopust, Tomáš (MU-W) RID, ORCID, SAIZdroj.dok. Developments in Language Theory. - Berlin : Springer, 2010 / Gao Y. ; Lu H. ; Seki S. - ISBN 978-3-642-14455-4 Rozsah stran s. 434-435 Poč.str. 2 s. Akce DLT2010. 14th International Conference on Developments in Language Theory Datum konání 17.08.2010-20.08.2010 Místo konání London Země CA - Kanada Typ akce WRD Jazyk dok. eng - angličtina Země vyd. DE - Německo Klíč. slova regulated rewriting ; context-free rules ; generative power Vědní obor RIV BA - Obecná matematika CEZ AV0Z10190503 - MU-W (2005-2011) UT WOS 000286402700040 EID SCOPUS 78049233264 DOI 10.1007/978-3-642-14455-4_40 Anotace In context-free grammars, each derivation step can be characterized so that (i) a nonterminal of the current sentential form is chosen and (ii) rewritten by a rule. However, it is well-known that context-free grammars are not able to cover all aspects of natural languages and/or programming languages. Therefore, there were defined many grammars with context-free rules and some mechanism controlling the application of rules, e. g., in random context grammars and their variants, a rule is only applicable if the current sentential form contains some letters or subwords and some letters or words do not occur in it. Therefore, in grammars controlled by context, each derivation step can be characterized so that (i) subsets of applicable nonterminals and rules are determined according to the symbols appearing in the current sentential form, (ii) an applicable nonterminal is chosen and (iii) rewritten by an applicable rule. Pracoviště Matematický ústav Kontakt Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757 Rok sběru 2011
Počet záznamů: 1