Cantitate/Preț
Produs

Theory Is Forever

Editat de Juhani Karhumäki, Hermann Maurer, Gheorghe Paun, Grzegorz Rozenberg
en Limba Engleză Paperback – 29 iun 2004

Preț: 33502 lei

Preț vechi: 41878 lei
-20%

Puncte Express: 503

Carte tipărită la comandă

Livrare economică 11-25 august

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.

Specificații

ISBN-13: 9783540223931
ISBN-10: 3540223932
Pagini: 300
Ilustrații: X, 286 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.46 kg
Ediția:2004
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Duality for Three: Ternary Symmetry in Process Spaces.- Mathematical Proofs at a Crossroad?.- Rational Relations as Rational Series.- Networks of Standard Watson-Crick D0L Systems with Incomplete Information Communication.- On the Size of Components of Probabilistic Cooperating Distributed Grammar Systems.- Remarks on Sublanguages Consisting of Primitive Words of Slender Regular and Context-Free Languages.- A Semiring-Semimodule Generalization of ?-Context-Free Languages.- Integer Weighted Finite Automata, Matrices, and Formal Power Series over Laurent Polynomials.- Two Models for Gene Assembly in Ciliates.- On Self-Dual Bases of the Extensions of the Binary Field.- On NFA Reductions.- Some Results on Directable Automata.- Rectangles and Squares Recognized by Two-Dimensional Automata.- Substitution on Trajectories.- Recombination Systems.- Algebraic Aspects of Parikh Matrices.- On Distributed Computing on Elliptic Curves.- On the Formal Modelling of Trust in Reputation-Based Systems.- Issues with Applying Cryptography in Wireless Systems.- On a Tomographic Equivalence Between (0,1)-Matrices.- P Systems with Tables of Rules.- Some Properties of Multistage Interconnection Networks.- Structural Equivalence of Regularly Extended E0L Grammars: An Automata Theoretic Proof.- Complexity of Evolving Interactive Systems.