|
![]() |
|||
|
||||
OverviewFull Product DetailsAuthor: Kenichi MoritaPublisher: Springer Verlag, Japan Imprint: Springer Verlag, Japan Edition: Softcover reprint of the original 1st ed. 2017 Dimensions: Width: 15.50cm , Height: 2.50cm , Length: 23.50cm Weight: 0.724kg ISBN: 9784431568322ISBN 10: 4431568328 Pages: 457 Publication Date: 23 May 2018 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Manufactured on demand ![]() We will order this item for you from a manufactured on demand supplier. Table of Contents1. Introduction.- 2. Reversible Logic Elements with Memory.- 3. Classification of Reversible Logic Elements with Memory and Their Universality.- 4. Reversible Logic Gates.- 5. Reversible Turing Machines.- 6. Making Reversible Turing Machines from Reversible Primitives.- 7. Universal Reversible Turing Machines.- 8. Space-Bounded Reversible Turing Machines.-9. Other Models of Reversible Machines.- 10. Reversible Cellular Automata.- 11. One-Dimensional Universal Reversible Cellular Automata.- 12. Two-Dimensional Universal Reversible Cellular Automata.- 13. Reversible Elementary Triangular Partitioned Cellular Automata.- 14. Self-reproduction in Reversible Cellular Automata.ReviewsThe book under review has several advantages in representation of reversible computing. First, exposition is developed in a rigorous theoretical setting of mathematical models of algorithms and automata. Second, the book has a high-quality and clear-cut architecture when exposition goes from the lowest level of reversible logic elements through reversible functional modules and composed logic elements to the high level of reversible abstract automata. (Mark S. Burgin, zbMATH 1383.68002, 2018) Author InformationKenichi Morita is a professor emeritus of Hiroshima University. He received a Ph.D. in engineering from Osaka University in 1978, and he was a professor of the Graduate School of Engineering, Hiroshima University. He is engaged in the research of automata theory, cellular automata, reversible computing, and formal language theory. Tab Content 6Author Website:Countries AvailableAll regions |