DocumentCode
3689667
Title
Formalization of context-free grammars by means of modified algebra of algorithms
Author
Volodymyr Ovsyak;Dmytro Bui;Oleksandr Ovsyak;Julia Petruszka
Author_Institution
Kielce University of Technology, Al. Tysionclecia Panstwa Polskiego 7, Kielce, 25-314, POLAND, Ukrainian Academy of Printing, Pid Holoskom 19, Lviv, 79-020, Ukraine
fYear
2015
Firstpage
212
Lastpage
215
Abstract
We consider the use of the modified algebra of algorithms to formalize the grammars and outputs of context-free grammars. The inference rules and the derivations themselves of several applied grammars have been given in formulas of modified algebra of algorithms. We illustrate the use of operations of sequencing as well as operations of paralleling to describe the rules of output.
Keywords
"Grammar","Algebra","Sequential analysis","Algorithm design and analysis","Inference algorithms","Electronic mail","Computer science"
Publisher
ieee
Conference_Titel
Scientific and Technical Conference "Computer Sciences and Information Technologies" (CSIT), 2015 Xth International
Type
conf
DOI
10.1109/STC-CSIT.2015.7325468
Filename
7325468
Link To Document