找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Developments in Language Theory; 19th International C Igor Potapov Conference proceedings 2015 Springer International Publishing Switzerlan

[復(fù)制鏈接]
樓主: 手鐲
21#
發(fā)表于 2025-3-25 04:39:26 | 只看該作者
Factorization in Formal Languages,tion “up to permutation” and “up to subset”. Although all these variations have been considered before, it appears that the languages of words having these properties have not been positioned in the Chomsky hierarchy up to now. We also consider the length of the shortest word . having the desired property.
22#
發(fā)表于 2025-3-25 08:40:29 | 只看該作者
23#
發(fā)表于 2025-3-25 14:23:56 | 只看該作者
Silvia Pastorekova,Claudiu T. Supuranaverses column by column. Thus, both models focus on the comparison of successive letters, i.e. “l(fā)ocal changes”. We prove closure (and non-closure) properties, show the decidability of the respective non-emptiness problems, prove limits on decidability results for extended models, and discuss open issues in the development of a generalized theory.
24#
發(fā)表于 2025-3-25 17:47:08 | 只看該作者
Photoacoustic Lifetime Imaging of Hypoxias. It contains also strictly all extensible one-sided shifts of finite type. Our result is thus an extension of the decidability of conjugacy between one-sided shifts of finite type obtained by Williams.
25#
發(fā)表于 2025-3-25 22:24:55 | 只看該作者
https://doi.org/10.1007/978-1-0716-3633-6 all . are powers of a single ., the length restriction is removed. In general, the restriction on . cannot be removed, even for powers of permutations: for every positive integer . there exists . and a pattern . which is unavoidable over all ..
26#
發(fā)表于 2025-3-26 02:33:37 | 只看該作者
27#
發(fā)表于 2025-3-26 07:26:55 | 只看該作者
28#
發(fā)表于 2025-3-26 09:08:36 | 只看該作者
29#
發(fā)表于 2025-3-26 12:43:16 | 只看該作者
https://doi.org/10.1007/978-3-642-67418-1tegies in such games can be described by context-sensitive languages. We also discuss consensus game acceptors with a restricted observation pattern that describe nondeterministic linear-time languages.
30#
發(fā)表于 2025-3-26 20:35:44 | 只看該作者
Consensus Game Acceptors,tegies in such games can be described by context-sensitive languages. We also discuss consensus game acceptors with a restricted observation pattern that describe nondeterministic linear-time languages.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-8 20:02
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
禹城市| 龙岩市| 泰和县| 德阳市| 海南省| 门头沟区| 凌海市| 彭泽县| 乌兰察布市| 福建省| 灌南县| 辽中县| 全椒县| 武夷山市| 辉南县| 额尔古纳市| 镇平县| 福州市| 肥西县| 平南县| 天镇县| 固阳县| 罗田县| 长武县| 新巴尔虎右旗| 邳州市| 博乐市| 清镇市| 吴堡县| 西藏| 绩溪县| 南陵县| 翼城县| 延吉市| 固安县| 汤原县| 宣威市| 关岭| 宁夏| 邢台市| 什邡市|