首页 > 最新文献

Workshop on Descriptional Complexity of Formal Systems最新文献

英文 中文
Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton 寻找正则残差有限状态自动机的双反转方法的推广
Pub Date : 2015-06-25 DOI: 10.1007/978-3-319-19225-3_23
Hellis Tamm
{"title":"Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton","authors":"Hellis Tamm","doi":"10.1007/978-3-319-19225-3_23","DOIUrl":"https://doi.org/10.1007/978-3-319-19225-3_23","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124247708","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}
引用次数: 4
A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0, 2] 索引正则树语言Wadge-Wagner层次的初步探讨[0,2]
Pub Date : 2015-06-25 DOI: 10.1007/978-3-319-19225-3_7
J. Duparc, K. Fournier
{"title":"A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0, 2]","authors":"J. Duparc, K. Fournier","doi":"10.1007/978-3-319-19225-3_7","DOIUrl":"https://doi.org/10.1007/978-3-319-19225-3_7","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128658272","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}
引用次数: 1
Universal Disjunctive Concatenation and Star 通用析取串联和星形
Pub Date : 2015-06-25 DOI: 10.1007/978-3-319-19225-3_17
Nelma Moreira, G. Pighizzini, Rogério Reis
{"title":"Universal Disjunctive Concatenation and Star","authors":"Nelma Moreira, G. Pighizzini, Rogério Reis","doi":"10.1007/978-3-319-19225-3_17","DOIUrl":"https://doi.org/10.1007/978-3-319-19225-3_17","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132725573","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}
引用次数: 2
Quantum Queries on Permutations 排列的量子查询
Pub Date : 2015-06-25 DOI: 10.1007/978-3-319-19225-3_15
Taisia Mischenko-Slatenkova, Alina Vasilieva, Ilja Kucevalovs, R. Freivalds
{"title":"Quantum Queries on Permutations","authors":"Taisia Mischenko-Slatenkova, Alina Vasilieva, Ilja Kucevalovs, R. Freivalds","doi":"10.1007/978-3-319-19225-3_15","DOIUrl":"https://doi.org/10.1007/978-3-319-19225-3_15","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114312167","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}
引用次数: 4
On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata 无状态确定性有序重启自动机的若干决策问题
Pub Date : 2015-06-25 DOI: 10.1007/978-3-319-19225-3_14
K. Kwee, F. Otto
{"title":"On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata","authors":"K. Kwee, F. Otto","doi":"10.1007/978-3-319-19225-3_14","DOIUrl":"https://doi.org/10.1007/978-3-319-19225-3_14","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121332766","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}
引用次数: 12
Star-Complement-Star on Prefix-Free Languages 无前缀语言上的Star-Complement-Star
Pub Date : 2015-06-25 DOI: 10.1007/978-3-319-19225-3_20
Matús Palmovský, Juraj Sebej
{"title":"Star-Complement-Star on Prefix-Free Languages","authors":"Matús Palmovský, Juraj Sebej","doi":"10.1007/978-3-319-19225-3_20","DOIUrl":"https://doi.org/10.1007/978-3-319-19225-3_20","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116907930","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}
引用次数: 4
Groups Whose Word Problem is a Petri Net Language 单词问题是Petri网语言的组
Pub Date : 2015-06-25 DOI: 10.1007/978-3-319-19225-3_21
Gabriela Asli Rino Nesin, R. Thomas
{"title":"Groups Whose Word Problem is a Petri Net Language","authors":"Gabriela Asli Rino Nesin, R. Thomas","doi":"10.1007/978-3-319-19225-3_21","DOIUrl":"https://doi.org/10.1007/978-3-319-19225-3_21","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129610332","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}
引用次数: 2
On Simulation Cost of Unary Limited Automata 一元有限自动机的仿真代价
Pub Date : 2015-06-25 DOI: 10.1007/978-3-319-19225-3_13
Martin Kutrib, Matthias Wendlandt
{"title":"On Simulation Cost of Unary Limited Automata","authors":"Martin Kutrib, Matthias Wendlandt","doi":"10.1007/978-3-319-19225-3_13","DOIUrl":"https://doi.org/10.1007/978-3-319-19225-3_13","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121747582","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}
引用次数: 9
On the Computational Complexity of Problems Related to Distinguishability Sets 关于可分辨集相关问题的计算复杂性
Pub Date : 2015-06-25 DOI: 10.1007/978-3-319-19225-3_10
M. Holzer, Sebastian Jakobi
{"title":"On the Computational Complexity of Problems Related to Distinguishability Sets","authors":"M. Holzer, Sebastian Jakobi","doi":"10.1007/978-3-319-19225-3_10","DOIUrl":"https://doi.org/10.1007/978-3-319-19225-3_10","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128117739","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}
引用次数: 1
Nondeterministic Tree Width of Regular Languages 正则语言的不确定树宽度
Pub Date : 2015-06-25 DOI: 10.1007/978-3-319-19225-3_4
C. Câmpeanu, K. Salomaa
{"title":"Nondeterministic Tree Width of Regular Languages","authors":"C. Câmpeanu, K. Salomaa","doi":"10.1007/978-3-319-19225-3_4","DOIUrl":"https://doi.org/10.1007/978-3-319-19225-3_4","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124686932","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}
引用次数: 2
期刊
Workshop on Descriptional Complexity of Formal Systems
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1