Descriptional Complexity of Formal Systems, Kartoniert / Broschiert
Descriptional Complexity of Formal Systems
- 26th IFIP WG 1.02 International Conference, DCFS 2025, Loughborough, UK, July 22-24, 2025, Proceedings
(soweit verfügbar beim Lieferanten)
- Herausgeber:
- Andreas Malcher, Luca Prigioniero
- Verlag:
- Springer, 07/2025
- Einband:
- Kartoniert / Broschiert
- Sprache:
- Englisch
- ISBN-13:
- 9783031970993
- Artikelnummer:
- 12344421
- Umfang:
- 256 Seiten
- Gewicht:
- 394 g
- Maße:
- 235 x 155 mm
- Stärke:
- 15 mm
- Erscheinungstermin:
- 1.7.2025
- Hinweis
-
Achtung: Artikel ist nicht in deutscher Sprache!
Klappentext
.- 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.
