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

Developments in Language Theory最新文献

筛选
英文 中文
Transition Property for documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$alpha $$end{document}-Power Free Languages w Transition Property for documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$alpha $$end{document}-Power Free Languages w
Developments in Language Theory Pub Date : 2020-05-26 DOI: 10.1007/978-3-030-48516-0_22
Josef Rukavicka
{"title":"Transition Property for documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$alpha $$end{document}-Power Free Languages w","authors":"Josef Rukavicka","doi":"10.1007/978-3-030-48516-0_22","DOIUrl":"https://doi.org/10.1007/978-3-030-48516-0_22","url":null,"abstract":"","PeriodicalId":236216,"journal":{"name":"Developments in Language Theory","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123866280","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
Computing the Shortest String and the Edit-Distance for Parsing Expression Languages 计算解析表达式语言的最短字符串和编辑距离
Developments in Language Theory Pub Date : 2020-05-11 DOI: 10.1007/978-3-030-48516-0_4
Hyunjoon Cheon, Yo-Sub Han
{"title":"Computing the Shortest String and the Edit-Distance for Parsing Expression Languages","authors":"Hyunjoon Cheon, Yo-Sub Han","doi":"10.1007/978-3-030-48516-0_4","DOIUrl":"https://doi.org/10.1007/978-3-030-48516-0_4","url":null,"abstract":"","PeriodicalId":236216,"journal":{"name":"Developments in Language Theory","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128559268","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
Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices 布尔矩阵中查找2 × 2子矩阵的复杂度
Developments in Language Theory Pub Date : 2020-05-11 DOI: 10.1007/978-3-030-48516-0_20
D. Prusa, Michael Wehar
{"title":"Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices","authors":"D. Prusa, Michael Wehar","doi":"10.1007/978-3-030-48516-0_20","DOIUrl":"https://doi.org/10.1007/978-3-030-48516-0_20","url":null,"abstract":"","PeriodicalId":236216,"journal":{"name":"Developments in Language Theory","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117309911","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
Context-Freeness of Word-MIX Languages Word-MIX语言的上下文无关性
Developments in Language Theory Pub Date : 2020-05-11 DOI: 10.1007/978-3-030-48516-0_23
Ryoma Sin'ya
{"title":"Context-Freeness of Word-MIX Languages","authors":"Ryoma Sin'ya","doi":"10.1007/978-3-030-48516-0_23","DOIUrl":"https://doi.org/10.1007/978-3-030-48516-0_23","url":null,"abstract":"","PeriodicalId":236216,"journal":{"name":"Developments in Language Theory","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129093286","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
Avoidability of Additive Cubes over Alphabets of Four Numbers 四数字母上加性立方的可回避性
Developments in Language Theory Pub Date : 2020-05-11 DOI: 10.1007/978-3-030-48516-0_15
Florian Lietard, M. Rosenfeld
{"title":"Avoidability of Additive Cubes over Alphabets of Four Numbers","authors":"Florian Lietard, M. Rosenfeld","doi":"10.1007/978-3-030-48516-0_15","DOIUrl":"https://doi.org/10.1007/978-3-030-48516-0_15","url":null,"abstract":"","PeriodicalId":236216,"journal":{"name":"Developments in Language Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133507908","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
On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations 组合方程组随机表达式的简并性
Developments in Language Theory Pub Date : 2020-05-11 DOI: 10.1007/978-3-030-48516-0_13
F. Koechlin, C. Nicaud, P. Rotondo
{"title":"On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations","authors":"F. Koechlin, C. Nicaud, P. Rotondo","doi":"10.1007/978-3-030-48516-0_13","DOIUrl":"https://doi.org/10.1007/978-3-030-48516-0_13","url":null,"abstract":"","PeriodicalId":236216,"journal":{"name":"Developments in Language Theory","volume":"504 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123516128","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 Study of a Simple Class of Modifiers: Product Modifiers 一类简单的改性剂:产品改性剂的研究
Developments in Language Theory Pub Date : 2020-05-11 DOI: 10.1007/978-3-030-48516-0_9
Pascal Caron, Edwin Hamel-De le Court, Jean-Gabriel Luque
{"title":"A Study of a Simple Class of Modifiers: Product Modifiers","authors":"Pascal Caron, Edwin Hamel-De le Court, Jean-Gabriel Luque","doi":"10.1007/978-3-030-48516-0_9","DOIUrl":"https://doi.org/10.1007/978-3-030-48516-0_9","url":null,"abstract":"","PeriodicalId":236216,"journal":{"name":"Developments in Language Theory","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128479445","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
Space Complexity of Stack Automata Models 堆栈自动机模型的空间复杂度
Developments in Language Theory Pub Date : 2020-05-11 DOI: 10.1007/978-3-030-48516-0_11
O. Ibarra, Jozef Jirásek, Ian McQuillan, Luca Prigioniero
{"title":"Space Complexity of Stack Automata Models","authors":"O. Ibarra, Jozef Jirásek, Ian McQuillan, Luca Prigioniero","doi":"10.1007/978-3-030-48516-0_11","DOIUrl":"https://doi.org/10.1007/978-3-030-48516-0_11","url":null,"abstract":"","PeriodicalId":236216,"journal":{"name":"Developments in Language Theory","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116681279","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
On Tree Substitution Grammars 关于树替换语法
Developments in Language Theory Pub Date : 2020-05-11 DOI: 10.1007/978-3-030-48516-0_18
A. Maletti, K. Stier
{"title":"On Tree Substitution Grammars","authors":"A. Maletti, K. Stier","doi":"10.1007/978-3-030-48516-0_18","DOIUrl":"https://doi.org/10.1007/978-3-030-48516-0_18","url":null,"abstract":"","PeriodicalId":236216,"journal":{"name":"Developments in Language Theory","volume":"12086 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129018465","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}
引用次数: 0
On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection 有限自动机的细粒度复杂度研究
Developments in Language Theory Pub Date : 2020-05-11 DOI: 10.1007/978-3-030-48516-0_6
Mateus de Oliveira Oliveira, Michael Wehar
{"title":"On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection","authors":"Mateus de Oliveira Oliveira, Michael Wehar","doi":"10.1007/978-3-030-48516-0_6","DOIUrl":"https://doi.org/10.1007/978-3-030-48516-0_6","url":null,"abstract":"","PeriodicalId":236216,"journal":{"name":"Developments in Language Theory","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121850431","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
下一页 尾页
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学术官方微信