Descriptional complexity of formal systems : 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual event, September 5, 2021, Proceedings / Yo-Sub Han, Sang-Ki Ko (eds.).
DCFS (Workshop) (23rd : 2021 : Online); Han, Yo-Sub, editor.; Ko, Sang-Ki, editor.
2021
QA267.3
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 : 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual event, September 5, 2021, Proceedings / Yo-Sub Han, Sang-Ki Ko (eds.).
Meeting Name
DCFS (Workshop) (23rd : 2021 : Online)
ISBN
9783030934897 (electronic bk.)
3030934896 (electronic bk.)
9783030934880 (print)
DOI
https://doi.org/10.1007/978-3-030-93489-7
Published
Cham, Switzerland : Springer, 2021.
Language
English
Description
1 online resource (x, 201 pages) : illustrations (some color).
Item Number
10.1007/978-3-030-93489-7 doi
Call Number
QA267.3
Dewey Decimal Classification
005.13/1
Summary
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 volume were carefully reviewed and selected from 21 submissions. The conference focus to all aspects of descriptional complexity-the costs of description of objects in various computational models such as Turing machines, pushdown automata, finite automata or grammars.
Note
Includes author index.
Access Note
Access limited to authorized users.
Digital File Characteristics
text file PDF
Source of Description
Online resource; title from PDF title page (SpringerLink, viewed January 4, 2022).
Added Author
Han, Yo-Sub, editor.
Ko, Sang-Ki, editor.
Series
Lecture notes in computer science ; 13037.
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Available in Other Form
Print version: 9783030934880
Print version: 9783030934903
Linked Resources
Online Access
Record Appears in
Online Resources > Ebooks
All Resources
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.

Browse Subjects

Show more subjects...

Statistics

from
to
Export