2 papers
cs.FL2019
Relational parsing: a clean, fast parsing strategy for all context-free languages
Grzegorz Herman
We present a novel parsing algorithm for all context-free languages, based on computing the relation between configurations and reaching transitions in a recursive transition netwo…
cs.CC2008
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Grzegorz Herman, Michael Soltys
Although a deterministic polytime algorithm for primality testing is now known, the Rabin-Miller randomized test of primality continues being the most efficient and widely used alg…