找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪問(wèn)微社區(qū)

打印 上一主題 下一主題

Titlebook: Developments in Language Theory; 27th International C Frank Drewes,Mikhail Volkov Conference proceedings 2023 The Editor(s) (if applicable)

[復(fù)制鏈接]
樓主: industrious
21#
發(fā)表于 2025-3-25 04:45:10 | 只看該作者
22#
發(fā)表于 2025-3-25 09:07:09 | 只看該作者
J. Koscielny,H. Kiesewetter,A. Haa?ed, automata that can permute the word in windows of a given size k, and automata that can permute the word in windows of an existentially-quantified bound. We study expressiveness, closure properties and algorithmic properties of these models.
23#
發(fā)表于 2025-3-25 14:31:41 | 只看該作者
24#
發(fā)表于 2025-3-25 16:33:08 | 只看該作者
Thrombozyt?re Signaltransduktionclasses of graphs - planar graphs, interval graphs, split graphs, co-bipartite graphs and line graphs - are shown to be two word-representable. An upper bound on the number of words needed to represent .colourable graphs has also been calculated.
25#
發(fā)表于 2025-3-25 22:28:31 | 只看該作者
Singers and Creativity in , and hat it is .-complete to check .-congruence of two regular languages and decidable up to recursive languages. Moreover, we tackle the problem of computing the maximum . that makes two given languages .-congruent. This problem is .-complete for two regular languages, and undecidable for context-free languages.
26#
發(fā)表于 2025-3-26 03:14:18 | 只看該作者
https://doi.org/10.1007/978-3-662-63502-5pected from a purely information-theoretic considerations. In the second part, we present experimental results obtained by the mentioned algorithm in the extreme case of .-ary words avoiding .-powers.
27#
發(fā)表于 2025-3-26 06:35:53 | 只看該作者
28#
發(fā)表于 2025-3-26 12:14:51 | 只看該作者
Conference proceedings 2023n, during June 12–16, 2023.?.The 20 full papers included in this book were carefully reviewed and selected from 32 submissions (31 regular ones and one invited).The DLT conference series provides a forum for presenting current developments informal languages and automata. Its scope is very general a
29#
發(fā)表于 2025-3-26 15:44:12 | 只看該作者
H?mofiltration, H?modialyse, H?mapheresestance interior operation whereas context-free languages are not. Then, we characterize the edit-distance interior languages and present a proper hierarchy with respect to the radius of operations. The family of edit-distance interior languages is closed under intersection, but not closed under union, complement and catenation.
30#
發(fā)表于 2025-3-26 18:00:15 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-7 04:00
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
锡林浩特市| 安阳县| 乳山市| 惠州市| 马关县| 池州市| 甘肃省| 巴塘县| 新丰县| 阜城县| 交城县| 辰溪县| 乃东县| 肥西县| 儋州市| 焦作市| 东安县| 临洮县| 修武县| 岐山县| 兰西县| 宁远县| 南木林县| 忻州市| 通许县| 内乡县| 仪陇县| 大城县| 容城县| 铁岭县| 牟定县| 深水埗区| 株洲县| 安塞县| 琼中| 闻喜县| 吉安县| 璧山县| 克什克腾旗| 上杭县| 廉江市|