Theory Is Forever
Editat de Juhani Karhumäki, Hermann Maurer, Gheorghe Paun, Grzegorz Rozenbergen Limba Engleză Paperback – 29 iun 2004
Preț: 321.17 lei
Preț vechi: 401.46 lei
-20% Nou
Puncte Express: 482
Preț estimativ în valută:
56.83€ • 66.64$ • 49.91£
56.83€ • 66.64$ • 49.91£
Carte tipărită la comandă
Livrare economică 09-23 februarie 26
Preluare comenzi: 021 569.72.76
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
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ă
ResearchCuprins
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.
Caracteristici
Includes supplementary material: sn.pub/extras