Cantitate/Preț
Produs
Total produse
Vezi coșul
Descriptional Complexity of Formal Systems: 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29–31, 2022, Proceedings de Yo-Sub Han

Descriptional Complexity of Formal Systems: 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29–31, 2022, Proceedings: Lecture Notes in Computer Science, cartea 13439

Editat de Yo-Sub Han, György Vaszil
en Limba Engleză Paperback – aug 2022
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. The book also contains 4 invited talks. The conference focus to all aspects of descriptional complexity including Automata, grammars, languages, and other formal systems; various modes of operations and complexity measures.


Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 49041 lei

Preț vechi: 61302 lei
-20% Nou

Puncte Express: 736
Preț estimativ în valută:
9386€ • 9847$ • 7786£

Carte tipărită la comandă

Livrare economică 29 ianuarie-12 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031132568
ISBN-10: 3031132564
Pagini: 213
Ilustrații: XXVIII, 213 p. 47 illus., 1 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.35 kg
Ediția:1st ed. 2022
Editura: Springer International Publishing
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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.