"Regular Tree Languages Without Unary Symbols are Star-Free."

Andreas Potthoff, Wolfgang Thomas (1993)

Details and statistics

DOI: 10.1007/3-540-57163-9_34

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-17

a service of  Schloss Dagstuhl - Leibniz Center for Informatics