FEEDBACK Smiley face
Normal view MARC view ISBD view

Theory Is Forever [electronic resource] :Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday /

Contributor(s): Karhumäki, Juhani [editor.] | Maurer, Hermann [editor.] | Păun, Gheorghe [editor.] | Rozenberg, Grzegorz [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 3113Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2004.Description: X, 286 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540278122.Subject(s): Computer science | Computers | Computer logic | Mathematical logic | Numerical analysis | Computer science -- Mathematics | Computer Science | Theory of Computation | Computation by Abstract Devices | Logics and Meanings of Programs | Mathematical Logic and Formal Languages | Discrete Mathematics in Computer Science | Numeric ComputingOnline resources: Click here to access online
Contents:
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.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in