找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Descriptional Complexity of Formal Systems; 18th IFIP WG 1.2 Int Cezar Câmpeanu,Florin Manea,Jeffrey Shallit Conference proceedings 2016 IF

[复制链接]
查看: 32021|回复: 58
发表于 2025-3-21 17:56:16 | 显示全部楼层 |阅读模式
书目名称Descriptional Complexity of Formal Systems
副标题18th IFIP WG 1.2 Int
编辑Cezar Câmpeanu,Florin Manea,Jeffrey Shallit
视频video
概述Includes supplementary material:
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Descriptional Complexity of Formal Systems; 18th IFIP WG 1.2 Int Cezar Câmpeanu,Florin Manea,Jeffrey Shallit Conference proceedings 2016 IF
描述his book constitutes the refereed proceedings of the 18th InternationalConference on Descriptional Complexity of Formal Systems, DCFS 2016,held in Bucharest, Romania, in July 2016. The 13 full papers presentedtogether with 4 invited talks were carefully reviewed and selected from21 submissions.Descriptional Complexity is a field in Computer Science that deals with the size of all kind of objects that occur in computational models, such as Turing Machines, finte automata, grammars, splicing systems and others. The topics of this conference are related to all aspects of descriptional complexity. .
出版日期Conference proceedings 2016
关键词automata theory; context free languages; formal languages; regular languages; turing machines; automata e
版次1
doihttps://doi.org/10.1007/978-3-319-41114-9
isbn_softcover978-3-319-41113-2
isbn_ebook978-3-319-41114-9Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightIFIP International Federation for Information Processing 2016
The information of publication is updating

书目名称Descriptional Complexity of Formal Systems影响因子(影响力)




书目名称Descriptional Complexity of Formal Systems影响因子(影响力)学科排名




书目名称Descriptional Complexity of Formal Systems网络公开度




书目名称Descriptional Complexity of Formal Systems网络公开度学科排名




书目名称Descriptional Complexity of Formal Systems被引频次




书目名称Descriptional Complexity of Formal Systems被引频次学科排名




书目名称Descriptional Complexity of Formal Systems年度引用




书目名称Descriptional Complexity of Formal Systems年度引用学科排名




书目名称Descriptional Complexity of Formal Systems读者反馈




书目名称Descriptional Complexity of Formal Systems读者反馈学科排名




单选投票, 共有 1 人参与投票
 

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:53:28 | 显示全部楼层
发表于 2025-3-22 03:27:39 | 显示全部楼层
https://doi.org/10.1007/978-3-031-41574-6We survey recent results on the descriptional complexity of self-verifying finite automata. In particular, we discuss the cost of simulation of self-verifying finite automata by deterministic finite automata, and the complexity of basic regular operations on languages represented by self-verifying finite automata.
发表于 2025-3-22 07:42:01 | 显示全部楼层
Computer Supported Cooperative WorkWe show that it is decidable given an MSO-definable property . of countable words and a Muller context-free grammar ., whether every word in the language generated by . satisfies ..
发表于 2025-3-22 09:52:15 | 显示全部楼层
Completely Reachable Automata,We present a few results and several open problems concerning complete deterministic finite automata in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word.
发表于 2025-3-22 12:55:57 | 显示全部楼层
发表于 2025-3-22 20:59:55 | 显示全部楼层
Self-Verifying Finite Automata and Descriptional Complexity,We survey recent results on the descriptional complexity of self-verifying finite automata. In particular, we discuss the cost of simulation of self-verifying finite automata by deterministic finite automata, and the complexity of basic regular operations on languages represented by self-verifying finite automata.
发表于 2025-3-23 00:24:21 | 显示全部楼层
发表于 2025-3-23 02:56:07 | 显示全部楼层
发表于 2025-3-23 09:29:47 | 显示全部楼层
The Irreplaceable Experience of Fieldworkd a minimal .-state DFA ., both defined over an alphabet . with ., such that the minimal DFA for the language .(.).(.) has exactly . states. This improves a similar result in the literature that uses an exponential alphabet.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-4-28 19:01
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表