{"title":"A Pumping Lemma for Output Languages of Macro Tree Transducers","authors":"Armin Kühnemann","doi":"10.1007/3-540-61064-2_28","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Colloquium on Trees in Algebra and Programming","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/3-540-61064-2_28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}