Descriptional Complexity of Formal Systems [E-Book] : 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings / edited by Yo-Sub Han, Sang-Ki Ko.
This book constitutes the proceedings of the 23rd International Conference on Descriptional Complexity of Format Systems, DCFS 2021, which was supposed to take place in Seoul South Korea in June 2021, but the conference was canceled due to the COVID-19 crisis. The 16 full papers presented in this vo...
Saved in:
Full text |
|
Personal Name(s): | Han, Yo-Sub, editor |
Ko, Sang-Ki, editor | |
Edition: |
1st edition 2021. |
Imprint: |
Cham :
Springer,
2021
|
Physical Description: |
X, 201 pages 30 illustrations, 5 illustrations in color (online resource) |
Note: |
englisch |
ISBN: |
9783030934897 |
DOI: |
10.1007/978-3-030-93489-7 |
Series Title: |
/* Depending on the record driver, $field may either be an array with
"name" and "number" keys or a flat string containing only the series
name. We should account for both cases to maximize compatibility. */?>
Theoretical Computer Science and General Issues ;
13037 /* Depending on the record driver, $field may either be an array with "name" and "number" keys or a flat string containing only the series name. We should account for both cases to maximize compatibility. */?> Lecture Notes in Computer Science |
Subject (LOC): |
- Complexity issues for the iterated h-preorders
- On the Uniform Distribution of Regular Expressions
- Deterministic one-way simulation of two-way deterministic finite automata over small alphabets
- Sync-Maximal Permutation Groups Equal Primitive Permutation Groups
- Commutative Regular Languages with Product-Form Minimal Automata
- State Complexity Bounds for Upward and Downward Closures on Commutative Languages and Commutative Group and Commutative Aperiodic Languages
- More on the Descriptional Complexity of Compositions of Finite Automata
- Width Measures of Alternating Finite Automata
- Partial Derivative Automaton by Compressing Regular Expressions
- State Complexity of Partial Word Finite Automata
- State complexity of union and intersection on graph-walking automata
- Gray cycles of maximum length related to $k$-character substitutions
- Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems
- Disambiguation of Weighted Tree Automata
- Image-Binary Automata
- Improved constructions for succinct affine automata.