Muutke küpsiste eelistusi

E-raamat: Implementation and Application of Automata: 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings

Edited by , Edited by
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 55,56 €*
  • * 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.
Implementation and Application of Automata: 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, 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 refereed proceedings of the 21st International
Conference on Implementation and Application of Automata, CIAA 2016,
held in Seoul, South Korea, in July 2016.

The 26 revised full papers presented were carefully reviewed and selected from
49 submissions. The papers cover a wide range of topics including characterizations of automata, computing distances between strings and languages, implementations of
automata and experiments, enhanced regular expressions, and complexity analysis. 
Decision Problems for Finite Automata over Infinite Algebraic
Structures.- The Degree of Irreversibility in Deterministic Finite
Automata.- Deterministic Stack Transducers.- Computing the Expected Edit
Distance from a String to a PFA.- Derived-Term Automata of Multitape Rational
Expressions.- Solving Parity Games Using an Automata-Based
Algorithm.- Ternary Equational Languages.- Problems on Finite Automata and
the Exponential Time Hypothesis.- A Practical Algorithm for the Uniform
Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree
Automata.- A Practical Simulation Result for Two-Way Pushdown
Automata.- Nondeterministic Complexity of Operations on Closed and Ideal
Languages.- On Bounded Semilinear Languages, Counter Machines,
and Finite-Index ET0L.- Kuratowski Algebras Generated by Prefix-Free
Languages.- A Logical Characterization of Small 2NFAs.- Experiments
withSynchronizing Automata.- Implementation of Code Properties via
Transducers.- On Synchronizing Automata and Uniform Distribution.- Looking
for the Pairs that are Hard to Separate: A Quantum Approach.- Prefix Distance
Between Regular Languages.- Complexity of Sets of Two-Dimensional
Patterns.- The Complexity of Fixed-Height Patterned Tile
Self-Assembly.- Derivative-Based Diagnosis of Regular Expression
Ambiguity.- Regular Approximation of Weighted Linear Nondeleting
Context-Free Tree Languages.- Derivatives for Enhanced Regular
Expressions.- Weighted Restarting Automata as Language Acceptors.- Enhancing
Practical TAG Parsing Efficiency by Capturing Redundancy.- Analyzing Matching
Time Behavior of Backtracking Regular ExpressionMatchers by Using Ambiguity
of NFA.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97833194094672e.html
Märksõnad: