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

Automatentheorie und Formale Sprachen最新文献

筛选
英文 中文
On the simulation of time bounded machines 有限时间机器的仿真
Automatentheorie und Formale Sprachen Pub Date : 1973-07-09 DOI: 10.1007/BFb0039160
B. Monien
{"title":"On the simulation of time bounded machines","authors":"B. Monien","doi":"10.1007/BFb0039160","DOIUrl":"https://doi.org/10.1007/BFb0039160","url":null,"abstract":"","PeriodicalId":211545,"journal":{"name":"Automatentheorie und Formale Sprachen","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1973-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115218283","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
Elementare und subelementare Funktionenklassen über binären Bäumen 是礼仪性极强的树
Automatentheorie und Formale Sprachen Pub Date : 1973-07-09 DOI: 10.1007/BFb0039158
E. Cohors-Fresenborg
{"title":"Elementare und subelementare Funktionenklassen über binären Bäumen","authors":"E. Cohors-Fresenborg","doi":"10.1007/BFb0039158","DOIUrl":"https://doi.org/10.1007/BFb0039158","url":null,"abstract":"","PeriodicalId":211545,"journal":{"name":"Automatentheorie und Formale Sprachen","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1973-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127821797","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
Erweiterungen subrekursiver Programmiersprachen
Automatentheorie und Formale Sprachen Pub Date : 1973-07-09 DOI: 10.1007/BFb0039169
R. Verbeek
{"title":"Erweiterungen subrekursiver Programmiersprachen","authors":"R. Verbeek","doi":"10.1007/BFb0039169","DOIUrl":"https://doi.org/10.1007/BFb0039169","url":null,"abstract":"","PeriodicalId":211545,"journal":{"name":"Automatentheorie und Formale Sprachen","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1973-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116532212","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
A drum scheduling algorithm 一种滚筒调度算法
Automatentheorie und Formale Sprachen Pub Date : 1973-07-09 DOI: 10.1007/BFb0039164
C. Wong, C. Liu, J. Apter
{"title":"A drum scheduling algorithm","authors":"C. Wong, C. Liu, J. Apter","doi":"10.1007/BFb0039164","DOIUrl":"https://doi.org/10.1007/BFb0039164","url":null,"abstract":"","PeriodicalId":211545,"journal":{"name":"Automatentheorie und Formale Sprachen","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1973-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123301198","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
A characterization of the classes L1 and R1 of primitive recursive wordfunctions 原始递归词函数的类L1和类R1的表征
Automatentheorie und Formale Sprachen Pub Date : 1973-07-09 DOI: 10.1007/BFb0039163
G. Rose, K. Weihrauch
{"title":"A characterization of the classes L1 and R1 of primitive recursive wordfunctions","authors":"G. Rose, K. Weihrauch","doi":"10.1007/BFb0039163","DOIUrl":"https://doi.org/10.1007/BFb0039163","url":null,"abstract":"","PeriodicalId":211545,"journal":{"name":"Automatentheorie und Formale Sprachen","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1973-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123596677","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
Ketten und arithmetische Prädikate von endlichen Automaten 不知道啊
Automatentheorie und Formale Sprachen Pub Date : 1973-07-09 DOI: 10.1007/BFb0039140
T. Ottmann
{"title":"Ketten und arithmetische Prädikate von endlichen Automaten","authors":"T. Ottmann","doi":"10.1007/BFb0039140","DOIUrl":"https://doi.org/10.1007/BFb0039140","url":null,"abstract":"","PeriodicalId":211545,"journal":{"name":"Automatentheorie und Formale Sprachen","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1973-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124681616","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
Quelques générateurs des langages algébriques 代数语言的一些生成器
Automatentheorie und Formale Sprachen Pub Date : 1973-07-09 DOI: 10.1007/BFb0039146
Jean-Michel Autebert
{"title":"Quelques générateurs des langages algébriques","authors":"Jean-Michel Autebert","doi":"10.1007/BFb0039146","DOIUrl":"https://doi.org/10.1007/BFb0039146","url":null,"abstract":"","PeriodicalId":211545,"journal":{"name":"Automatentheorie und Formale Sprachen","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1973-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129195748","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
A characterization of boolean closures of families of languages 语言族的布尔闭包的表征
Automatentheorie und Formale Sprachen Pub Date : 1973-07-09 DOI: 10.1007/BFb0039154
D. Wotschke
{"title":"A characterization of boolean closures of families of languages","authors":"D. Wotschke","doi":"10.1007/BFb0039154","DOIUrl":"https://doi.org/10.1007/BFb0039154","url":null,"abstract":"","PeriodicalId":211545,"journal":{"name":"Automatentheorie und Formale Sprachen","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1973-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131731784","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
Une hierarchie infinie de cones d'accepteurs vérificateurs 验证接受锥的无限层次
Automatentheorie und Formale Sprachen Pub Date : 1973-07-09 DOI: 10.1007/BFb0039141
F. Rodriguez
{"title":"Une hierarchie infinie de cones d'accepteurs vérificateurs","authors":"F. Rodriguez","doi":"10.1007/BFb0039141","DOIUrl":"https://doi.org/10.1007/BFb0039141","url":null,"abstract":"","PeriodicalId":211545,"journal":{"name":"Automatentheorie und Formale Sprachen","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1973-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128643147","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 the structure of algorithmic problems 论算法问题的结构
Automatentheorie und Formale Sprachen Pub Date : 1973-07-09 DOI: 10.1007/BFb0039133
E. Engeler
{"title":"On the structure of algorithmic problems","authors":"E. Engeler","doi":"10.1007/BFb0039133","DOIUrl":"https://doi.org/10.1007/BFb0039133","url":null,"abstract":"","PeriodicalId":211545,"journal":{"name":"Automatentheorie und Formale Sprachen","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1973-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127020071","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}
引用次数: 6
下一页 尾页
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学术官方微信