# Theory is forever : essays dedicated to Arto Salomaa on the occasion of his 70th birthday / Juhani Karhumäki [and others].

##### Contributor(s): Salomaa, Arto | Karhumäki, Juhani

Material type: TextSeries: SerienbezeichnungLecture notes in computer science: 3113.; Lecture notes in computer science: Publisher: Berlin ; New York, NY : Springer, 2004Description: 1 online resource (x, 281 pages) : illustrations, portraitContent type: text Media type: computer Carrier type: online resourceISBN: 3540278125; 9783540278122Subject(s): Computer science | Computer science -- Mathematics | Machine theory | COMPUTERS -- Reference | COMPUTERS -- Machine Theory | COMPUTERS -- Computer Literacy | COMPUTERS -- Information Technology | COMPUTERS -- Data Processing | COMPUTERS -- Computer Science | COMPUTERS -- Hardware -- General | Computer science | Computer science -- Mathematics | Machine theory | Theoretische InformatikGenre/Form: Electronic books. | Aufsatzsammlung. Additional physical formats: Print version:: Theory is forever.DDC classification: 004/.01/51 LOC classification: QA76.9.M35 | T44 2004ebOther classification: 54.10 | 004 | p | 11-03-05 | DAT 500f | SS 4800 Online resources: Click here to access onlineItem type | Current location | Collection | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|

eBook |
e-Library
Electronic Book@IST |
EBook | Available |

Festschrift.

Includes bibliographical references and index.

Print version record.

This commemorative book celebrates the 70th birthday of Arto Kustaa Salomaa, one of the most influential researchers in theoretical computer science. The 24 invited papers by leading researchers in the area address a broad variety of topics in theoretical computer science and impressively reflect the breadth and the depth of Arto Salomaa's scientific work.

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.