Franklin

Theory Is Forever [electronic resource] : Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday / edited by Juhani Karhumäki, Hermann Maurer, Gheorghe Paun, Grzegorz Rozenberg.

Edition:
1st ed. 2004.
Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.
Series:
Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 3113
Lecture Notes in Computer Science, 0302-9743 ; 3113
Format/Description:
Book
1 online resource (X, 286 pages)
Subjects:
Computers.
Computer logic.
Logic, Symbolic and mathematical.
Computer science-Mathematics.
Numerical analysis.
Local subjects:
Theory of Computation.
Computation by Abstract Devices.
Logics and Meanings of Programs.
Mathematical Logic and Formal Languages.
Discrete Mathematics in Computer Science.
Numeric Computing.
System Details:
text file PDF
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.
Contributor:
Karhumäki, Juhani, editor., Editor,
Maurer, H. (Hermann), editor., Editor,
Păun, Gheorghe, editor., Editor,
Rozenberg, Grzegorz, editor., Editor,
SpringerLink (Online service)
Contained In:
Springer eBooks
Other format:
Printed edition:
Printed edition:
ISBN:
978-3-540-27812-2
9783540278122
Publisher Number:
10.1007/b98751 doi
Access Restriction:
Restricted for use by site license.
Loading...
Location Notes Your Loan Policy
Description Status Barcode Your Loan Policy