We present the first machine-checked formalization of Jaffe and Ehrenfeucht, Parikh and Rozenberg’s (EPR) pumping lemmas in the Coq proof assistant. We formulate regularity in terms of finite derivatives, and prove that both Jaffe’s pumping property and EPR’s block pumping property precisely characterize regularity. We illuminate EPR’s classical proof that the block cancellation property implies regularity, and discover that—as best we can tell—their proof relies on the Axiom of Choice. We provide a new proof which eliminates the use of Choice. We explicitly construct an function which computes block cancelable languages from well-formed short languages.
Wed 4 Dec
10:30 - 12:00: Research Papers - Logic and Automata at Bali Room Chair(s): Peter ThiemannUniversity of Freiburg, Germany | ||||||||||||||||||||||||||||||||||||||||||
| 10:30 - 11:00 Talk | Aquinas HoborNational University of Singapore, Singapore, Elaine LiRuntime Verification, Inc., Frank StephanNational University of Singapore | |||||||||||||||||||||||||||||||||||||||||
| 11:00 - 11:30 Talk | Yu-Fang ChenAcademia Sinica, Vojtěch HavlenaBrno University of Technology, Ondrej LengalBrno University of Technology | |||||||||||||||||||||||||||||||||||||||||
| 11:30 - 12:00 Talk | Lukas HolikBrno University of Technology, Tomas VojnarBrno University of Technology, Ondrej LengalBrno University of Technology , Lenka TuronovaBrno University of Technology, Margus VeanesMicrosoft Research, Olli Saarikivi | |||||||||||||||||||||||||||||||||||||||||