Descriptional Complexity of Formal Systems
Editat de Yo-Sub Han, Sang-Ki Koen Limba Engleză Paperback – 25 dec 2021
Preț: 371.39 lei
Preț vechi: 464.25 lei
-20% Nou
Puncte Express: 557
Preț estimativ în valută:
65.71€ • 76.67$ • 57.45£
65.71€ • 76.67$ • 57.45£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
Preluare comenzi: 021 569.72.76
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
Locul publicării:Cham, Switzerland
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
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.