Amazon cover image
Image from Amazon.com

Descriptional complexity of formal systems : 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings / Henning Bordihn, Nicholas Tran, György Vaszil, editors.

By: Contributor(s): Material type: TextTextSeries: Lecture notes in computer science ; 13918.Publisher: Cham : Springer, [2023]Description: 1 online resource (xvi, 197 pages) : illustrations (some color)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783031343261
  • 3031343263
Other title:
  • DCFS 2023
Subject(s): Genre/Form: DDC classification:
  • 005.13/1 23/eng/20230626
LOC classification:
  • QA267.3 .D34 2023
Online resources:
Contents:
Operational State Complexity Revisited: the Contribution of Monsters and Modifiers -- Hypercubes and Isometric Words based on Swap and Mismatch Distance -- Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle -- Existential and Universal Width of Alternating Finite Automata -- On Jaffe's Pumping Lemma, Revisited -- Operational Complexity: NFA-to-DFA Trade-Off -- The Word Problem for Finitary Automaton Groups -- Separating Words Problem over Groups -- Complexity of Exclusive Nondeterministic Finite Automata -- Shortest Accepted Strings for Two-Way Finite Automata: Approaching the Lower Bound -- Pushdown and One-Counter Automata: Constant and Non-Constant Memory Usage -- Construction of a Bi-Infinite Power Free Word with a Given Factor and a Non-Recurrent Letter -- Merging two Hierarchies of External Contextual Grammars with Subregular Selection -- A Tight Upper Bound on the Length of Maximal Bordered Box Repetition-Free Words.
Summary: This book constitutes the proceedings of the 25th International Conference on Descriptional Complexity of Format Systems, DCFS 2023, which took place in Potsdam, Germany, in July 2023. The 14 full papers, including one invited presentation as a full paper, presented in this volume were carefully reviewed and selected from 16 submissions. The conference focus on all aspects of descriptional complexity, including automata, grammars, languages, and other formal systems; various modes of operations and complexity measures.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

Operational State Complexity Revisited: the Contribution of Monsters and Modifiers -- Hypercubes and Isometric Words based on Swap and Mismatch Distance -- Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle -- Existential and Universal Width of Alternating Finite Automata -- On Jaffe's Pumping Lemma, Revisited -- Operational Complexity: NFA-to-DFA Trade-Off -- The Word Problem for Finitary Automaton Groups -- Separating Words Problem over Groups -- Complexity of Exclusive Nondeterministic Finite Automata -- Shortest Accepted Strings for Two-Way Finite Automata: Approaching the Lower Bound -- Pushdown and One-Counter Automata: Constant and Non-Constant Memory Usage -- Construction of a Bi-Infinite Power Free Word with a Given Factor and a Non-Recurrent Letter -- Merging two Hierarchies of External Contextual Grammars with Subregular Selection -- A Tight Upper Bound on the Length of Maximal Bordered Box Repetition-Free Words.

This book constitutes the proceedings of the 25th International Conference on Descriptional Complexity of Format Systems, DCFS 2023, which took place in Potsdam, Germany, in July 2023. The 14 full papers, including one invited presentation as a full paper, presented in this volume were carefully reviewed and selected from 16 submissions. The conference focus on all aspects of descriptional complexity, including automata, grammars, languages, and other formal systems; various modes of operations and complexity measures.

Includes author index.

Online resource; title from PDF title page (SpringerLink, viewed June 26, 2023).

Powered by Koha