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.
DCFS (Workshop) (25th : 2023 : Potsdam, Germany); Bordihn, Henning, editor.; Tran, Nicholas, editor.; Vaszil, György, editor.
2023
QA267.3 .D34 2023
Available Online

Linked e-resources

Linked Resource
Online Access
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks

Details

Title
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.
Meeting Name
DCFS (Workshop) (25th : 2023 : Potsdam, Germany)
ISBN
9783031343261 (electronic bk.)
3031343263 (electronic bk.)
9783031343254
DOI
https://doi.org/10.1007/978-3-031-34326-1
Published
Cham : Springer, [2023]
Language
English
Description
1 online resource (xvi, 197 pages) : illustrations (some color).
Item Number
10.1007/978-3-031-34326-1 doi
Call Number
QA267.3 .D34 2023
Dewey Decimal Classification
005.13/1
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.
Note
Includes author index.
Access Note
Access limited to authorized users.
Source of Description
Online resource; title from PDF title page (SpringerLink, viewed June 26, 2023).
Added Author
Bordihn, Henning, editor.
Tran, Nicholas, editor.
Vaszil, György, editor.
Series
Lecture notes in computer science ; 13918. 1611-3349
Linked Resources
Online Access
Record Appears in
Online Resources > Ebooks
All Resources
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.

Browse Subjects

Show more subjects...

Statistics

from
to
Export