"How to Prove that a Language Is Regular or Star-Free?"

Jean-Éric Pin (2020)

Details and statistics

DOI: 10.1007/978-3-030-40608-0_5

access: closed

type: Conference or Workshop Paper

metadata version: 2020-02-27

a service of  Schloss Dagstuhl - Leibniz Center for Informatics