Automata Implementation
Editat de Oliver Boldt, Helmut Jürgensenen Limba Engleză Paperback – 24 oct 2001
Preț: 316.83 lei
Preț vechi: 396.04 lei
-20%
Puncte Express: 475
Preț estimativ în valută:
55.98€ • 64.89$ • 48.82£
55.98€ • 64.89$ • 48.82£
Carte tipărită la comandă
Livrare economică 15-29 mai
Specificații
ISBN-13: 9783540428121
ISBN-10: 3540428127
Pagini: 196
Ilustrații: VII, 189 p.
Dimensiuni: 155 x 235 x 11 mm
Greutate: 0.31 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540428127
Pagini: 196
Ilustrații: VII, 189 p.
Dimensiuni: 155 x 235 x 11 mm
Greutate: 0.31 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
V-ar putea interesa
-
The C++ Programming LanguageBjarne Stroustrup-20%Preț: 516.11 lei645.13 lei -
Python Programming for Biology: Bioinformatics and BeyondTim J. Stevens-20%Preț: 455.63 lei569.54 lei -
Beginning Programming with C++ for DummiesStephen R. Davis-20%Preț: 138.34 lei172.93 lei -
Pro ASP.NET Web API Security: Securing ASP.NET Web APIBadrinarayanan Lakshmiraghavan-20%Preț: 521.46 lei651.81 lei -
-20%Preț: 230.97 lei288.71 lei -
-20%Preț: 144.54 lei180.69 lei -
Functional Programming in ScalaRunar Bjarnason-20%Preț: 285.28 lei356.60 lei -
Python Programming for BeginnersJoseph Joyner-20%Preț: 50.93 lei63.66 lei -
Murachs C# 2012Joel Murach-28%Preț: 344.64 lei479.98 lei -
Descriptional Complexity of Formal SystemsHelmut Jürgensen-20%Preț: 326.26 lei407.83 lei -
Rewriting Logic and Its ApplicationsDorel Lucanu-20%Preț: 317.26 lei396.57 lei -
Programming LanguagesFernando Castor-20%Preț: 317.04 lei396.30 lei -
Computer Safety, Reliability, and SecurityAmund Skavhaug-20%Preț: 324.22 lei405.27 lei -
Preț: 406.57 lei -
Risikomanagement bei ImmobilienfinanzierungenOliver Boldt-19%Preț: 487.25 lei601.53 lei -
Preț: 443.87 lei
Public țintă
ResearchCuprins
FA Minimisation Heuristics for a Class of Finite Languages.- SEA: A Symbolic Environment for Automata Theory.- Analysis of Reactive Systems with n Timers.- Animation of the Generation and Computation of Finite Automata for Learning Software.- Metric Lexical Analysis.- State Complexity of Basic Operations on Finite Languages.- Treatment of Unknown Words.- Computing Entropy Maps of Finite-Automaton-Encoded Binary Images.- Thompson Digraphs: A Characterization.- Finite Automata Encoding Geometric Figures.- Compressed Storage of Sparse Finite-State Transducers.- An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing.- Multiset Processing by Means of Systems of Finite State Transducers.- A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits.- An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata.- A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata.
Caracteristici
Includes supplementary material: sn.pub/extras