Muutke küpsiste eelistusi

E-raamat: Descriptional Complexity of Formal Systems: 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings

Edited by , Edited by , Edited by
Teised raamatud teemal:
  • Formaat - EPUB+DRM
  • Hind: 67,91 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Descriptional Complexity of Formal Systems: 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, ProceedingsSuurem pilt
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97830313432616e.html
Märksõnad: