On sentence membership problem in context-sensitive languages
Computer Science and Mathematical Modelling · 2017
DOI: 10.5604/01.3001.0010.5520 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computer Science and Mathematical Modelling, 2017. Verfasst von Paweł Ryszawa. Die Arbeit nennt 10 Literaturangaben.
Abstract (Originalsprache)
A new type of graph is introduced, the grammar graph. The possibility of assigning labels to each node in such a graph extends it to the grammar net. The grammar net should be considered as a new graphical tool that helps in an analysis of whether a particular sentence belongs to a given context-sensitive grammar. Another concept, the derivation net, closely related to the grammar graph and of a similar structure, will be used to show an algorithm that is able to decide that some sentences do not belong to a language generated by a context sensitive grammar, while leaving others as a candidate members of it.
Zitieren
APA
Ryszawa, P. (2017). On sentence membership problem in context-sensitive languages. Computer Science and Mathematical Modelling. https://doi.org/10.5604/01.3001.0010.5520
Vancouver
Ryszawa P. On sentence membership problem in context-sensitive languages. Computer Science and Mathematical Modelling. 2017. doi:10.5604/01.3001.0010.5520
BibTeX
@article{Ryszawa2017,
author = {Ryszawa, Paweł},
title = {On sentence membership problem in context-sensitive languages},
journal = {Computer Science and Mathematical Modelling},
year = {2017},
doi = {10.5604/01.3001.0010.5520}
}
EUVIMED