On the Comparison of Context-Free Grammars
Formal Languages and Automata Theory
2018-04-23 v2
Abstract
In this paper we consider the problem of context-free grammars comparison from the analysis point of view. We show that the problem can be reduced to numerical solution of systems of nonlinear matrix equations. The approach presented here forms a basis for probabilistic comparison algorithms oriented to automatic assessment of of student's answers in computer science.
Cite
@article{arxiv.1702.05945,
title = {On the Comparison of Context-Free Grammars},
author = {J. Joao Almeida and Eliana Grande and Georgi Smirnov},
journal= {arXiv preprint arXiv:1702.05945},
year = {2018}
}