找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Developments in Language Theory; 14th International C Yuan Gao,Hanlin Lu,Sheng Yu Conference proceedings 2010 Springer-Verlag Berlin Heidel

[复制链接]
楼主: 搭话
发表于 2025-3-23 10:04:29 | 显示全部楼层
发表于 2025-3-23 14:17:46 | 显示全部楼层
https://doi.org/10.1007/978-1-4684-1071-6 theoretical computer science. We namely describe how properties of DNA-based information, and in particular the Watson-Crick complementarity of DNA single strands, have influenced areas of theoretical computer science such as formal language theory, coding theory, automata theory and combinatorics on words.
发表于 2025-3-23 20:33:49 | 显示全部楼层
https://doi.org/10.1007/978-3-86226-845-0ets of integers and automatic sequences. We briefly sketch some results about transcendence related to the representation of real numbers. We conclude with some applications to combinatorial game theory and verification of infinite-state systems and present a list of open problems.
发表于 2025-3-23 22:58:42 | 显示全部楼层
发表于 2025-3-24 02:34:53 | 显示全部楼层
Rankers over Infinite Wordsr, the first extension of rankers admits a characterization of . while the other leads to a characterization of .. Both versions of rankers yield characterizations of the fragment Δ. = Σ. ∩ Π.. As a byproduct, we also obtain characterizations based on unambiguous temporal logic and unambiguous interval temporal logic.
发表于 2025-3-24 09:56:00 | 显示全部楼层
Two-Way Unary Automata versus Logarithmic Spacety and the state complexity of two-way unary automata: it indicates that L could be separated from NL by proving a superpolynomial gap, in the number of states, for the conversion from unary 2NFAs to 2DFAs.
发表于 2025-3-24 13:27:25 | 显示全部楼层
Gian Franco Baronzio,E. Dieter Hagerfirst proof of the undecidability of the inclusion problem for NE-pattern languages that, in contrast to previous proofs, does not rely on the inclusion problem for E-pattern languages, and proves the undecidability of the inclusion problem for NE-pattern languages over binary and ternary alphabets.
发表于 2025-3-24 16:22:42 | 显示全部楼层
Hyperthermia In Cancer Treatment: A Primere. where all its letters are made different. Experimental results suggest that the average number of states of this automaton, and of the . automaton for the unmarked regular expression, are very close to each other.
发表于 2025-3-24 22:00:00 | 显示全部楼层
发表于 2025-3-25 00:30:57 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-18 23:55
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表