| Record Type: |
Electronic resources
: Monograph/item
|
| Title/Author: |
Descriptional complexity of formal systems/ edited by Henning Bordihn, Nicholas Tran, Gyorgy Vaszil. |
| Reminder of title: |
25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023 : proceedings / |
| remainder title: |
DCFS 2023 |
| other author: |
Bordihn, Henning. |
| corporate name: |
DCFS (Workshop) |
| Published: |
Cham :Springer Nature Switzerland : : 2023., |
| Description: |
xvi, 197 p. :ill. (some col.), digital ;24 cm. |
| [NT 15003449]: |
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. |
| Contained By: |
Springer Nature eBook |
| Subject: |
Formal languages - Congresses. - |
| Online resource: |
https://doi.org/10.1007/978-3-031-34326-1 |
| ISBN: |
9783031343261 |