Cantitate/Preț
Produs
Total produse
Vezi coșul
Descriptional Complexity of Formal Systems de Yo-Sub Han

Descriptional Complexity of Formal Systems: Lecture Notes in Computer Science, cartea 13037

Editat de Yo-Sub Han, Sang-Ki Ko
en Limba Engleză Paperback – 25 dec 2021
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 37254 lei

Preț vechi: 46567 lei
-20%

Puncte Express: 559

Carte tipărită la comandă

Livrare economică 04-18 iunie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783030934880
ISBN-10: 3030934888
Pagini: 212
Ilustrații: X, 201 p. 30 illus., 5 illus. in color.
Dimensiuni: 155 x 235 x 12 mm
Greutate: 0.33 kg
Ediția:1st ed. 2021
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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.