Descriptional Complexity of Formal Systems: 22nd International Conference, DCFS 2020, Vienna, Austria, August 24–26, 2020, Proceedings

Author:   Galina Jirásková ,  Giovanni Pighizzini
Publisher:   Springer Nature Switzerland AG
Edition:   2020 ed.
Volume:   12442
ISBN:  

9783030625351


Pages:   245
Publication Date:   07 November 2020
Format:   Paperback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $116.41 Quantity:  
Add to Cart

Share |

Descriptional Complexity of Formal Systems: 22nd International Conference, DCFS 2020, Vienna, Austria, August 24–26, 2020, Proceedings


Add your own review!

Overview

This book constitutes the proceedings of the 22nd International Conference on Descriptional Complexity of Format Systems, DCFS 2020, which was supposed to take place in Vienna, Austria, in August 2020, but the conference was canceled due to the COVID-19 crisis.The 19 full papers presented in this volume were carefully reviewed and selected from 31 submissions. They deal with all aspects of descriptional complexity and costs of description of objects in various computational models, such as Turing machines, pushdown automata, finite automata, grammars, and others.

Full Product Details

Author:   Galina Jirásková ,  Giovanni Pighizzini
Publisher:   Springer Nature Switzerland AG
Imprint:   Springer Nature Switzerland AG
Edition:   2020 ed.
Volume:   12442
Weight:   0.454kg
ISBN:  

9783030625351


ISBN 10:   3030625354
Pages:   245
Publication Date:   07 November 2020
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

Mutually Accepting Capacitated Automata.- Bad pictures: some structural properties related to overlaps.- Regular Expression Length via Arithmetic Formula Complexity.- Crisp-determinization of Weighted Tree Automata over Additively Locally Finite and Past-finite Monotonic Strong Bimonoids is Decidable.- On the Power of Generalized Forbidding Insertion-Deletion Systems.- State Complexity Bounds for the Commutative Closure of Group Languages.- Multiple Concatenation and State Complexity (Extended Abstract).- Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata.- Longer shortest strings in two-way finite automata.- Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion.- Descriptional Complexity of Winning Sets of Regular Languages.- State complexity of GF(2)-inverse and GF(2)-star on binary languages.- Complexity of Two-dimensional Rank-reducing Grammars.- Palindromic Length of Words with Many Periodic Palindromes.- Operational Complexity of Straight Line Programs for Regular Languages.- Classifying ω-Regular Aperiodic k-Partitions.- Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata.- On the Generative Power of Quasiperiods.- Insertion-Deletion Systems With Substitutions II.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

RGJUNE2025

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List