Muutke küpsiste eelistusi

E-raamat: Descriptional Complexity of Formal Systems: 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings

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: 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, 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 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.

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.

Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97830309348976e.html
Märksõnad: