Theory is forever : essays dedicated to Arto Salomaa on the occasion of his 70th birthday
Salvato in:
| Autore principale: | |
|---|---|
| Altri autori: | , |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
3113 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Variante du titre: | Mélanges :, Salomaa |
| Edition sous un autre format: | • Theory is forever, essays dedicated to Arto Salomaa on the occasion of his 70th birthday, Juhani Karhumäki, Hermann Maurer, Gheorghe Paun ... [et al.], Berlin, Springer, 2004, 1 vol. (X-281 p.), Lecture notes in computer science, 3-540-22393-2 • Theory Is Forever, Texte imprimé, 9783662168103 |
Sommario:
- 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.