Descriptional Complexity of Formal Systems

26th IFIP WG 1.02 International Conference, DCFS 2025, Loughborough, UK, July 22–24, 2025, Proceedings

AvAndreas Malcher,Luca Prigioniero

Häftad, Engelska, 2025

Del 15759 i serien Lecture Notes in Computer Science

1 433 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the refereed proceedings of the 26th IFIP WG 1.02 International Conference on Descriptional Complexity of Formal Systems, DCFS 2025, held in Loughborough, UK, during July 22–24, 2025.This book includes 15 full papers, carefully reviewed and selected from 20 submissions, as well as 4 abstracts of the invited talks. The conference focus on all aspects of descriptional complexity, including automata, grammars, languages, and other formal systems; various modes of operations and complexity measures.

Produktinformation

Utgivningsdatum:2025-07-01
Mått:155 x 235 x 15 mm
Vikt:394 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:225
Förlag:Springer International Publishing AG
ISBN:9783031970993

Utforska kategorier

Hårdvara inom Data och IT
Systemvetenskap och AI inom Data och IT
Artificiell intelligens inom Data och IT

Innehållsförteckning

.- Fibonacci Pictures on a Binary Alphabet..- A Close Analysis of the Subset Construction..- k-local Graphs..- Word-Representable Graphs and Locality of Words..- Automata for Synchronised Shuffle on Backbones..- Two-Word Shuffle: Some Results..- Matrix Forbidding Grammars..- On the Decidability and Expressive Power of Several Theories Based on String Constraints..- Scattered Context Grammars with One Non-Context-Free Production and Six Nonterminals are Computationally Complete..- Disjunctive Complexity..- Two-Way Finite Automata with Translucent Input Letters..- Relative Densities of Formal Languages..- On A Measure for The Descriptional Complexity of Finite Automata with Translucent Words..- What is the Most Natural Generalization of the Pumping Lemmas for Regular and Context-Free Languages?..- Small Balanced Vertex Separators in NFA to Regular Expression Conversion.