用户名  找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Language and Automata Theory and Applications; 11th International C Frank Drewes,Carlos Martín-Vide,Bianca Truthe Conference proceedings 20

[复制链接]
楼主: cerebral
发表于 2025-3-23 13:38:45 | 显示全部楼层
发表于 2025-3-23 16:54:56 | 显示全部楼层
发表于 2025-3-23 18:24:20 | 显示全部楼层
发表于 2025-3-24 01:48:46 | 显示全部楼层
Consensus String Problem for Multiple Regular Languages the consensus string problem for . regular languages using additive weighted finite automata. We show that the consensus string problem for multiple regular languages becomes intractable when . is not fixed. We also examine the case when the length of the consensus string is given as part of input.
发表于 2025-3-24 02:42:49 | 显示全部楼层
发表于 2025-3-24 09:02:40 | 显示全部楼层
发表于 2025-3-24 13:33:16 | 显示全部楼层
The Strong, Weak, and Very Weak Finite Context and Kernel Propertiesassumed to hold of the target language for the dual algorithm to succeed. We also show that the weak finite context property is genuinely weaker than Clark’s ., settling a question raised by Yoshinaka.
发表于 2025-3-24 17:08:19 | 显示全部楼层
An Automata View to Goal-Directed Methodsement, and optimize. In this paper, we show that consequence-based reasoning can be reduced to the emptiness test of an appropriately built automaton. Thanks to this reduction, one can focus on developing efficient consequence-based algorithms, obtaining complexity bounds and other benefits of automata methods for free.
发表于 2025-3-24 21:37:24 | 显示全部楼层
发表于 2025-3-25 00:15:02 | 显示全部楼层
On the Complexity of Hard Enumeration Problemsclasses analogous to the polynomial hierarchy and an appropriate notion of problem reduction are missing. In this work, we lay the foundations for a complexity theory of hard enumeration problems by proposing a hierarchy of complexity classes and by investigating notions of reductions for enumeration problems.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-7-8 08:39
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表