Pub Date : 2017-07-03DOI: 10.1007/978-3-319-60252-3_24
A. Okhotin, K. Salomaa
{"title":"The Quotient Operation on Input-Driven Pushdown Automata","authors":"A. Okhotin, K. Salomaa","doi":"10.1007/978-3-319-60252-3_24","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_24","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126452010","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-03DOI: 10.1007/978-3-319-60252-3_15
Jozef Jirásek, Matús Palmovský, Juraj Sebej
{"title":"Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages","authors":"Jozef Jirásek, Matús Palmovský, Juraj Sebej","doi":"10.1007/978-3-319-60252-3_15","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_15","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129204077","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-05-04DOI: 10.1007/978-3-319-60252-3_8
M. Dimitrijevs, A. Yakaryılmaz
{"title":"Uncountable Realtime Probabilistic Classes","authors":"M. Dimitrijevs, A. Yakaryılmaz","doi":"10.1007/978-3-319-60252-3_8","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_8","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124130847","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-04-24DOI: 10.1007/978-3-319-60252-3_12
Kitti Gelle, Szabolcs Iván
{"title":"Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete","authors":"Kitti Gelle, Szabolcs Iván","doi":"10.1007/978-3-319-60252-3_12","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_12","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126758153","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-07-05DOI: 10.1007/978-3-319-41114-9_4
Rafaela Bastos, Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
{"title":"On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection","authors":"Rafaela Bastos, Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis","doi":"10.1007/978-3-319-41114-9_4","DOIUrl":"https://doi.org/10.1007/978-3-319-41114-9_4","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125107205","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-07-05DOI: 10.1007/978-3-319-41114-9_2
Gabriel Istrate, C. Bonchis
{"title":"Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems","authors":"Gabriel Istrate, C. Bonchis","doi":"10.1007/978-3-319-41114-9_2","DOIUrl":"https://doi.org/10.1007/978-3-319-41114-9_2","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124372677","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-07-05DOI: 10.1007/978-3-319-41114-9_3
Galina Jirásková
{"title":"Self-Verifying Finite Automata and Descriptional Complexity","authors":"Galina Jirásková","doi":"10.1007/978-3-319-41114-9_3","DOIUrl":"https://doi.org/10.1007/978-3-319-41114-9_3","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121155338","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-07-05DOI: 10.1007/978-3-319-41114-9_8
H. Fernau, R. Freund, R. Siromoney, K. Subramanian
{"title":"Contextual Array Grammars with Matrix and Regular Control","authors":"H. Fernau, R. Freund, R. Siromoney, K. Subramanian","doi":"10.1007/978-3-319-41114-9_8","DOIUrl":"https://doi.org/10.1007/978-3-319-41114-9_8","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123268495","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-07-05DOI: 10.1007/978-3-319-41114-9_14
Laurette Marais, L. V. Zijl
{"title":"Unary Self-verifying Symmetric Difference Automata","authors":"Laurette Marais, L. V. Zijl","doi":"10.1007/978-3-319-41114-9_14","DOIUrl":"https://doi.org/10.1007/978-3-319-41114-9_14","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116455536","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-07-05DOI: 10.1007/978-3-319-41114-9_7
Z. Ésik, Szabolcs Iván
{"title":"MSO-definable Properties of Muller Context-Free Languages Are Decidable","authors":"Z. Ésik, Szabolcs Iván","doi":"10.1007/978-3-319-41114-9_7","DOIUrl":"https://doi.org/10.1007/978-3-319-41114-9_7","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124608742","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：