Developments in language theory : 25th International Conference, DLT 2021, Porto, Portugal, August 16-20, 2021 : proceedings
著者
書誌事項
Developments in language theory : 25th International Conference, DLT 2021, Porto, Portugal, August 16-20, 2021 : proceedings
(Lecture notes in computer science, 12811 . LNCS sublibrary ; SL1 . Theoretical computer science and general issues)
Springer, c2021
大学図書館所蔵 全1件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references and index
内容説明・目次
内容説明
This book constitutes the proceedings of the 25th International Conference on Developments in Language Theory, DLT 2021, which was held in Porto, Portugal, during August 16-20, 2021. The conference took place in an hybrid format with both in-person and online participation.The 27 full papers included in these proceedings were carefully reviewed and selected from 48 submissions. The DLT conference series provides a forum for presenting current developments in formal 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; algebraic theories of automata; algorithmic, combinatorial, and algebraic properties of words and languages; variable length codes; symbolic dynamics; cellular 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; quantum computing. The book also includes 3 invited talks in full paper length.
目次
Invited Talks.- Morphic sequences versus automatic sequences.- Parsimonious Computational Completeness Pointlike sets and separation: a personal perspective.- Regular Papers.- A strong non-overlapping Dyck code.- Active Learning of Sequential Transducers with Side Information about the Domain.- Compositions of Constant Weighted Extended Tree Transducers.- Extremal Binary PFAs in a Cerny Family.- Variations on the Post Correspondence Problem for Free Groups.- Reducing local alphabet size in recognizable picture languages.- Properties of Graphs Specified by a Regular Language.- Balanced-by-construction regular and omega-regular languages.- Weighted Prefix Normal Words: Mind the Gap.- Two-Way Non-Uniform Finite Automata.- Integer Weighted Automata on Infinite Words.- Deciding FO2 Alternation for Automata over Finite and Infinite Words.- State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters.- Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata.- Lyndon words formalized in Isabelle/HOL.- The Range of State Complexities of Languages Resulting from the Cascade Product-The General Case (Extended Abstract).- Second-order finite automata: expressive power and simple proofs using automatic structures.- Reversible Top-Down Syntax Analysis.- Symmetry groups of infinite words.- Bounded Languages Described by GF(2)-grammas.- Definability Results for Top-Down Tree Transducers.- The hardest LL(k) language.- Upper Bounds on Distinct Maximal (Sub-)Repetitions in Compressed Strings.- Branching Frequency and Markov Entropy of Repetition-Free Languages.- A Linear-time Simulation of Deterministic d-Limited Automata.- Caratheodory Extensions of Subclasses of Regular Languages.- Parikh Word Representable Graphs and Morphisms.
「Nielsen BookData」 より