Nonregularity via Ordinal Extensions
Formal Languages and Automata Theory
2020-01-27 v1
Abstract
We present a simple new method for proving that languages are not regular. We prove the correctness of the method, illustrate the ease of using the method on well-known examples of nonregular languages, and prove two additional theorems on the power and limitations of the method.
Cite
@article{arxiv.2001.08846,
title = {Nonregularity via Ordinal Extensions},
author = {Jack H. Lutz and Giora Slutzki},
journal= {arXiv preprint arXiv:2001.08846},
year = {2020}
}