Fr. 69.00

Category Theory Applied to Computation and Control - Proceedings of the First International Symposium, San Francisco, February 25-26, 1974

English · Paperback / Softback

Shipping usually within 1 to 2 weeks (title will be printed to order)

Description

Read more










Basic concepts of category theory applicable to computation and control.- A control theorist looks at abstract nonsense.- A Categorist's view of automata and systems.- Categorical theory of tree processing.- Realization of multilinear and multidecomposable machines.- Fuzzy morphishms in automata theory.- Time-varying systems.- Addressed machines and duality.- Factorization of scott-style automata.- An abstract machine theory for formal language parsers.- Some structural properties of automata defined on groups.- Automata in additive categories with applications to stochastic linear automata.- The algebraic theory of recursive program schemes.- Realization is continuously universal.- Diagram-characterization of recursion.- Power and initial automata in pseudoclosed categories.- Semantics of computation.- Scattering theory and non linear systems.- Synthesis and complexity of logical systems.- Strukturelle verwandtschaften von Semi-Thue-Systemen.- Control of linear continuous-time systems defined over rings of distributions.- Cellular automata with additive local transition.- Automata in semimodule categories.- Representation of a class of nonlinear systems.- Duals of input/output maps.- An algebraic formulation of the Chomsky hierarchy.- On the recursive specification of data types.- Linear systems over rings of operators.- The tricotyledon theory of system design.

List of contents

Basic concepts of category theory applicable to computation and control.- A control theorist looks at abstract nonsense.- A Categorist's view of automata and systems.- Categorical theory of tree processing.- Realization of multilinear and multidecomposable machines.- Fuzzy morphishms in automata theory.- Time-varying systems.- Addressed machines and duality.- Factorization of scott-style automata.- An abstract machine theory for formal language parsers.- Some structural properties of automata defined on groups.- Automata in additive categories with applications to stochastic linear automata.- The algebraic theory of recursive program schemes.- Realization is continuously universal.- Diagram-characterization of recursion.- Power and initial automata in pseudoclosed categories.- Semantics of computation.- Scattering theory and non linear systems.- Synthesis and complexity of logical systems.- Strukturelle verwandtschaften von Semi-Thue-Systemen.- Control of linear continuous-time systems defined over rings of distributions.- Cellular automata with additive local transition.- Automata in semimodule categories.- Representation of a class of nonlinear systems.- Duals of input/output maps.- An algebraic formulation of the Chomsky hierarchy.- On the recursive specification of data types.- Linear systems over rings of operators.- The tricotyledon theory of system design.

Product details

Assisted by G Manes (Editor), E G Manes (Editor), E. G. Manes (Editor), E.G. Manes (Editor), Ernest Manes (Editor)
Publisher Springer, Berlin
 
Languages English
Product format Paperback / Softback
Released 29.06.2009
 
EAN 9783540071426
ISBN 978-3-540-07142-6
No. of pages 248
Weight 372 g
Illustrations XII, 248 p.
Series Lecture Notes in Computer Science
Lecture Notes in Computer Science
Subject Natural sciences, medicine, IT, technology > IT, data processing > IT

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.