找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Development in Language Theory; 15th International C Giancarlo Mauri,Alberto Leporati Conference proceedings 2011 Springer-Verlag GmbH Berl

[复制链接]
楼主: Hermit
发表于 2025-3-28 18:22:22 | 显示全部楼层
发表于 2025-3-28 20:39:11 | 显示全部楼层
https://doi.org/10.1007/978-3-319-30334-5xity of right ideals and prefix-closed languages, and that there exist left ideals and suffix-closed languages of syntactic complexity .. + . − 1, and two-sided ideals and factor-closed languages of syntactic complexity .. + (. − 2)2. + 1.
发表于 2025-3-28 22:55:59 | 显示全部楼层
发表于 2025-3-29 06:00:07 | 显示全部楼层
发表于 2025-3-29 07:14:27 | 显示全部楼层
发表于 2025-3-29 13:19:22 | 显示全部楼层
发表于 2025-3-29 18:01:49 | 显示全部楼层
User Generated Dialogue Systems: uDialogue,in this class of languages. Then we prove the existence of a unique maximal autosimulation relation in a given 2OTA and the existence of a unique minimal 2OTA which is simulation equivalent to this given 2OTA, both computable in polynomial time.
发表于 2025-3-29 21:58:31 | 显示全部楼层
发表于 2025-3-30 02:05:52 | 显示全部楼层
Avoiding Abelian Powers in Partial Wordsabelian .-free partial words of length . with . holes over a given alphabet grows exponentially as . increases. Finally, we prove that we cannot avoid abelian .th powers under arbitrary insertion of holes in an infinite word.
发表于 2025-3-30 07:51:42 | 显示全部楼层
Simulations over Two-Dimensional On-Line Tessellation Automatain this class of languages. Then we prove the existence of a unique maximal autosimulation relation in a given 2OTA and the existence of a unique minimal 2OTA which is simulation equivalent to this given 2OTA, both computable in polynomial time.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-4-27 13:21
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表