找回密碼
 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ù) 返回頂部 返回列表
玉山县| 文登市| 广饶县| 姚安县| 曲阳县| 调兵山市| 巴林右旗| 同仁县| 高邮市| 波密县| 通海县| 柘荣县| 高陵县| 福州市| 山阴县| 苍山县| 花莲县| 临湘市| 鲜城| 台前县| 徐汇区| 多伦县| 平阳县| 乳山市| 红安县| 葵青区| 松溪县| 柏乡县| 定南县| 莱阳市| 海晏县| 门源| 建瓯市| 历史| 西安市| 大名县| 保德县| 西和县| 五河县| 昌乐县| 江西省|