Atjaunināt sīkdatņu piekrišanu

Descriptional Complexity of Formal Systems: 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 46, 2023, Proceedings 1st ed. 2023 [Mīkstie vāki]

Edited by , Edited by , Edited by
  • Formāts: Paperback / softback, 197 pages, height x width: 235x155 mm, weight: 338 g, 13 Illustrations, color; 29 Illustrations, black and white; XVI, 197 p. 42 illus., 13 illus. in color., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 13918
  • Izdošanas datums: 30-May-2023
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 3031343255
  • ISBN-13: 9783031343254
Citas grāmatas par šo tēmu:
  • Mīkstie vāki
  • Cena: 55,83 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 65,69 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
Descriptional Complexity of Formal Systems: 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 46, 2023, Proceedings 1st ed. 2023Palielināt
  • Formāts: Paperback / softback, 197 pages, height x width: 235x155 mm, weight: 338 g, 13 Illustrations, color; 29 Illustrations, black and white; XVI, 197 p. 42 illus., 13 illus. in color., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 13918
  • Izdošanas datums: 30-May-2023
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 3031343255
  • ISBN-13: 9783031343254
Citas grāmatas par šo tēmu:
Permanent link: https://www.kriso.lv/db/9783031343254.html
Keywords:
This book constitutes the proceedings of the 25th International Conference on Descriptional Complexity of Format Systems, DCFS 2023, which took place in Potsdam, Germany, in July 2023.

The 14 full papers, including one invited presentation as a full paper, presented in this volume were carefully reviewed and selected from 16 submissions. The conference focus on all aspects of descriptional complexity, including automata, grammars, languages, and other formal systems; various modes of operations and complexity measures.

Operational State Complexity Revisited: the Contribution of Monsters and
Modifiers.- Hypercubes and Isometric Words based on Swap and Mismatch
Distance.- Defying Gravity and Gadget Numerosity: The Complexity of the
Hanano Puzzle.- Existential and Universal Width of Alternating Finite
Automata.- On Jaffes Pumping Lemma, Revisited     .- Operational Complexity:
NFA-to-DFA Trade-Off.- The Word Problem for Finitary Automaton Groups.-
Separating Words Problem over Groups.- Complexity of Exclusive
Nondeterministic Finite Automata.- Shortest Accepted Strings for Two-Way
Finite Automata: Approaching the
 Lower Bound.- Pushdown and One-Counter Automata: Constant and
Non-Constant Memory Usage.- Construction of a Bi-Infinite Power Free Word
with a Given Factor and a Non-Recurrent Letter.- Merging two Hierarchies of
External Contextual Grammars with Subregular Selection.- A Tight Upper Bound
on the Length of Maximal Bordered Box Repetition-Free Words.