找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
查看: 14628|回复: 62
发表于 2025-3-21 16:55:09 | 显示全部楼层 |阅读模式
书目名称Developments in Language Theory
副标题27th International C
编辑Frank Drewes,Mikhail Volkov
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Developments in Language Theory; 27th International C Frank Drewes,Mikhail Volkov Conference proceedings 2023 The Editor(s) (if applicable)
描述.This book constitutes the refereed proceedings of the 27th International Conference on Developments in Language Theory, DLT 2023, held in Umeå, Sweden, 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 and includes, among others, the following topics and areas: grammars, acceptors and transducers for words; trees and graphs; relations between formal languages and artificial neural networks; algebraic theories of automata; algorithmic, combinatorial, and algebraic properties of words and languages; variable length codes; symbolic dynamics; cellular automata; groups and semigroups generated by automata; polyominoes and multidimensional patterns; decidability questions; image manipulation and compression; efficient text algorithms; relationships to cryptography, concurrency, complexity theory, and logic; bio-inspired computing; and quantum computing..
出版日期Conference proceedings 2023
关键词automata theory; finite automata; formal languages; graph theory; linguistics; theory of computation; form
版次1
doihttps://doi.org/10.1007/978-3-031-33264-7
isbn_softcover978-3-031-33263-0
isbn_ebook978-3-031-33264-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightThe Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl
The information of publication is updating

书目名称Developments in Language Theory影响因子(影响力)




书目名称Developments in Language Theory影响因子(影响力)学科排名




书目名称Developments in Language Theory网络公开度




书目名称Developments in Language Theory网络公开度学科排名




书目名称Developments in Language Theory被引频次




书目名称Developments in Language Theory被引频次学科排名




书目名称Developments in Language Theory年度引用




书目名称Developments in Language Theory年度引用学科排名




书目名称Developments in Language Theory读者反馈




书目名称Developments in Language Theory读者反馈学科排名




单选投票, 共有 1 人参与投票
 

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:11:43 | 显示全部楼层
Isometric Words Based on Swap and Mismatch Distance, into the other one. A word . is said isometric with respect to an edit distance if, for any pair of .-free words . and ., there exists a transformation of minimal length from . to . via the related edit operations such that all the intermediate words are also .-free. The adjective “isometric” comes
发表于 2025-3-22 00:50:46 | 显示全部楼层
,Set Augmented Finite Automata over Infinite Alphabets,ain defined over a countably infinite set). In this paper, we introduce set augmented finite automata (SAFA), a new class of automata for expressing data languages. SAFA is able to recognize data languages while storing a few data values in most cases. We investigate nonemptiness, membership, closur
发表于 2025-3-22 04:39:05 | 显示全部楼层
发表于 2025-3-22 10:06:36 | 显示全部楼层
,Weak Inverse Neighborhoods of Languages,al regex matching engines. This motivates us to introduce a new operation. We define the edit-distance interior operation on a language . to compute the largest subset .(.) of . such that the edit-distance neighborhood of .(.) is in .. In other words, . includes the edit-distance neighborhood of the
发表于 2025-3-22 15:57:10 | 显示全部楼层
,Bit Catastrophes for the Burrows-Wheeler Transform,g. We study this phenomenon for the Burrows-Wheeler Transform (BWT), a string transform at the heart of several of the most popular compressors and aligners today. The parameter determining the size of the compressed data is the number of equal-letter runs of the BWT, commonly denoted ...We exhibit
发表于 2025-3-22 18:22:52 | 显示全部楼层
发表于 2025-3-22 21:44:04 | 显示全部楼层
发表于 2025-3-23 04:59:01 | 显示全部楼层
,Zielonka DAG Acceptance and Regular Languages over Infinite Words,ZA) and show that they are the first known automaton type with all of the following properties: .We compare Zielonka DAG acceptance to many other known acceptance types and give a complete description of their relative succinctness. Further, we show that non-deterministic Zielonka DAG automata turn
发表于 2025-3-23 08:47:10 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-4-30 18:24
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表