Descriptional Complexity of Formal Systems

24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29–31, 2022, Proceedings

AvYo-Sub Han,György Vaszil

Häftad, Engelska, 2022

Del 13439 i serien Lecture Notes in Computer Science

830 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the proceedings of the 24th International Conference on Descriptional Complexity of Format Systems, DCFS 2022, which was supposed to take place in Debrecen, Hungary in August 2022. The 14 full papers presented in this volume were carefully reviewed and selected from 17 submissions.

Produktinformation

Utgivningsdatum:2022-08-01
Mått:155 x 235 x 18 mm
Vikt:376 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:213
Förlag:Springer International Publishing AG
ISBN:9783031132568

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Artificiell intelligens inom Data och IT
Hårdvara inom Data och IT

Innehållsförteckning

The Alphabetic Complexity in Homomorphic Definitions of Word, Tree and Picture Languages.- Ranking Binary Unlabelled Necklaces in Polynomial Time.- On the Power of Recursive Word-Functions without Concatenation.- Clusters of Repetition Roots Forming Prefix Chains.- Nearly k-Universal Words - Investigating a Part of Simon’s Congruence.- State Complexity of Binary Coded Regular Languages.- Reset Complexity and Completely Reachable Automata with Simple Idempotents.- On the Descriptional Complexity of the Direct Product of Finite Automata.- Operations on Subregular Languages and Nondeterministic State Complexity.- On Simon’s Congruence Closure of a String.- Approximate NFA Universality Motivated by Information Theory.- Lazy Regular Sensing.- State Complexity of Finite Partial Languages.- Yet Another Canonical Nondeterministic Automaton.- Union-Complexities of Kleene Plus Operation.