找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Implementation and Application of Automata; 19th International C Markus Holzer,Martin Kutrib Conference proceedings 2014 Springer Internati

[复制链接]
楼主: DEIFY
发表于 2025-3-23 16:39:40 | 显示全部楼层
发表于 2025-3-23 18:12:12 | 显示全部楼层
Minimal Partial Languages and Automatag full languages. Our paper focuses on algorithms for the construction of minimal partial languages, associated with some ⋄-substitution, as well as approximation algorithms for the construction of minimal ⋄-DFAs.
发表于 2025-3-24 00:00:51 | 显示全部楼层
发表于 2025-3-24 03:17:53 | 显示全部楼层
发表于 2025-3-24 09:33:30 | 显示全部楼层
A Type System for Weighted Automata and Rational Expressionsf a static type system for automata. Between such a low-level layer and the interactive high-level interface, the type system plays the crucial role of a mediator and allows for a cleanly-structured use of dynamic compilation.
发表于 2025-3-24 11:19:48 | 显示全部楼层
发表于 2025-3-24 17:44:25 | 显示全部楼层
发表于 2025-3-24 21:15:11 | 显示全部楼层
On the Square of Regular Languages is hard for the square operation on languages accepted by alternating finite automata. In the unary case, the known upper bound for square is 2. − 1, and we prove that each value in the range from 1 to 2. − 1 may be attained by the state complexity of the square of a unary language with state complexity . whenever . ≥ 5.
发表于 2025-3-25 00:03:41 | 显示全部楼层
Recognition of Labeled Multidigraphs by Spanning Tree Automataled multidigraphs for a spanning tree automaton is NP-complete because the Hamiltonian path problem can be easily reduced to it. However, it will be shown that the membership problem is solvable in linear time for graphs of bounded tree-width.
发表于 2025-3-25 06:09:37 | 显示全部楼层
Counting Equivalent Linear Finite Transducers Using a Canonical Formprove that every LFT has exactly one equivalent canonical LFT. We then show how this canonical LFT allows us to calculate the size of each equivalence class on the set of the LFTs with the same number of states.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-23 03:07
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表