Muutke küpsiste eelistusi

E-raamat: Descriptional Complexity of Formal Systems: 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, Proceedings

Edited by , Edited by
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 80,26 €*
  • * 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: 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, 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 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.


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