Central Library

Normal view MARC view ISBD view

Descriptional Complexity of Formal Systems [electronic resource] : 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings / edited by Henning Bordihn, Nicholas Tran, György Vaszil.

Contributor(s): Bordihn, Henning [editor.] | Tran, Nicholas [editor.] | Vaszil, György [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 13918Publisher: Cham : Springer Nature Switzerland : Imprint: Springer, 2023Edition: 1st ed. 2023.Description: XVI, 197 p. 42 illus., 13 illus. in color. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783031343261.Subject(s): Computer science | Computer engineering | Computer networks  | Artificial intelligence | Computer Science Logic and Foundations of Programming | Computer Engineering and Networks | Artificial IntelligenceAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.0151 Online resources: Click here to access online
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.
In: Springer Nature eBookSummary: 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.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.