Abstract
Solomon Marcus (1925–2016) was one of the founders of the Romanian theoretical computer science. His pioneering contributions to automata and formal language theories, mathematical linguistics and natural computing have been widely recognised internationally. In this paper we briefly present his publications in theoretical computer science and related areas, which consist in almost ninety papers. Finally we present a selection of ten Marcus books in these areas.
Highlights
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations
These books have been translated in several languages (French, English, German, Russian, Italian, Czech, Spanish, Greek and other languages) and published by Academic Press, Dunod, Nauka and other well-known international publishers. They had a very high international audience and impact. His first paper in formal language theory was published in 1963 and it is illustrative for his permanent interest in building bridges between apparently disjoint research areas; in this case, finite automata, regular grammars, arithmetical progressions
The last category deserves a closer study, which we only suggest here: To systematically extend notions/ideas from mathematical analysis to formal language theory in general and to combinatorics on words in particular
Summary
Informaticae (vol 64), with the title Contagious Creativity This syntagma describes accurately the activity and the character of Marcus, a Renaissance-like personality, with remarkable contributions to several research areas (mathematical analysis, mathematical linguistics, theoretical computer science, semiotics, applications of all these in various areas, history and philosophy of science, education), with many disciples in Romania and abroad and with a wide recognition all around the world. They had a very high international audience and impact His first paper in formal language theory was published in 1963 and it is illustrative for his permanent interest in building bridges between apparently disjoint research areas; in this case, finite automata, regular grammars, arithmetical progressions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.