发布求助
文献互助 智能选刊 最新文献

Workshop on Descriptional Complexity of Formal Systems最新文献

筛选
英文 中文
Properties of Right One-Way Jumping Finite Automata 右单向跳跃有限自动机的性质
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2018-07-25 DOI: 10.1007/978-3-319-94631-3_2
Simon Beier, M. Holzer
{"title":"Properties of Right One-Way Jumping Finite Automata","authors":"Simon Beier, M. Holzer","doi":"10.1007/978-3-319-94631-3_2","DOIUrl":"https://doi.org/10.1007/978-3-319-94631-3_2","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128278832","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}
引用次数: 17
Cover Complexity of Finite Languages 涵盖有限语言的复杂性
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2018-07-25 DOI: 10.1007/978-3-319-94631-3_12
Stefan Hetzl, Simon Wolfsteiner
{"title":"Cover Complexity of Finite Languages","authors":"Stefan Hetzl, Simon Wolfsteiner","doi":"10.1007/978-3-319-94631-3_12","DOIUrl":"https://doi.org/10.1007/978-3-319-94631-3_12","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120881003","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
Forward Injective Finite Automata: Exact and Random Generation of Nonisomorphic NFAs 正向内射有限自动机:非同构nfa的精确和随机生成
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2018-07-25 DOI: 10.1007/978-3-319-94631-3_8
Miguel Ferreira, Nelma Moreira, Rogério Reis
{"title":"Forward Injective Finite Automata: Exact and Random Generation of Nonisomorphic NFAs","authors":"Miguel Ferreira, Nelma Moreira, Rogério Reis","doi":"10.1007/978-3-319-94631-3_8","DOIUrl":"https://doi.org/10.1007/978-3-319-94631-3_8","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121967050","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}
引用次数: 3
Site-Directed Insertion: Decision Problems, Maximality and Minimality 网站导向插入:决策问题，最大值和最小值
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2018-04-30 DOI: 10.1007/978-3-319-94631-3_5
Da-Jung Cho, Yo-Sub Han, K. Salomaa, Taylor J. Smith
{"title":"Site-Directed Insertion: Decision Problems, Maximality and Minimality","authors":"Da-Jung Cho, Yo-Sub Han, K. Salomaa, Taylor J. Smith","doi":"10.1007/978-3-319-94631-3_5","DOIUrl":"https://doi.org/10.1007/978-3-319-94631-3_5","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123283654","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
Most Complex Deterministic Union-Free Regular Languages 最复杂的确定性无联合规则语言
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2017-11-24 DOI: 10.1007/978-3-319-94631-3_4
J. Brzozowski, Sylvie Davies
{"title":"Most Complex Deterministic Union-Free Regular Languages","authors":"J. Brzozowski, Sylvie Davies","doi":"10.1007/978-3-319-94631-3_4","DOIUrl":"https://doi.org/10.1007/978-3-319-94631-3_4","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129156908","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
Reset Complexity of Ideal Languages Over a Binary Alphabet 二进制字母表上理想语言的重置复杂度
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2017-07-03 DOI: 10.1007/978-3-319-60252-3_21
M. Maslennikova
{"title":"Reset Complexity of Ideal Languages Over a Binary Alphabet","authors":"M. Maslennikova","doi":"10.1007/978-3-319-60252-3_21","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_21","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"14 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":"130307203","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}
引用次数: 5
A Parametrized Analysis of Algorithms on Hierarchical Graphs 层次图算法的参数化分析
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2017-07-03 DOI: 10.1007/978-3-319-60252-3_9
R. Faran, O. Kupferman
{"title":"A Parametrized Analysis of Algorithms on Hierarchical Graphs","authors":"R. Faran, O. Kupferman","doi":"10.1007/978-3-319-60252-3_9","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_9","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"17 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":"126251396","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
On the Average Complexity of Strong Star Normal Form 强星范式的平均复杂度
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2017-07-03 DOI: 10.1007/978-3-319-60252-3_6
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
{"title":"On the Average Complexity of Strong Star Normal Form","authors":"Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis","doi":"10.1007/978-3-319-60252-3_6","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_6","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":"129702527","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}
引用次数: 3
Branching Measures and Nearly Acyclic NFAs 分支度量和近无环NFAs
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2017-07-03 DOI: 10.1007/978-3-319-60252-3_16
C. Keeler, K. Salomaa
{"title":"Branching Measures and Nearly Acyclic NFAs","authors":"C. Keeler, K. Salomaa","doi":"10.1007/978-3-319-60252-3_16","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_16","url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"63 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":"129243086","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}
引用次数: 8
One-Time Nondeterministic Computations 一次性不确定性计算
Workshop on Descriptional Complexity of Formal Systems Pub Date : 2017-07-03 DOI: 10.1007/978-3-319-60252-3_14
M. Holzer, Martin Kutrib
{"title":"One-Time Nondeterministic Computations","authors":"M. Holzer, Martin Kutrib","doi":"10.1007/978-3-319-60252-3_14","DOIUrl":"https://doi.org/10.1007/978-3-319-60252-3_14","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":"133327354","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}
引用次数: 3
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信