What is he best known for?
The fields of study he is best known for:
- Algebra
- Programming language
- Algorithm
Arto Salomaa mostly deals with Theoretical computer science, Discrete mathematics, Formal language, Regular language and Linguistics.
Arto Salomaa interconnects Computation, DNA computing, Turing machine, State and Theory of computation in the investigation of issues within Theoretical computer science.
The various areas that Arto Salomaa examines in his Discrete mathematics study include Formal power series, Rational series, Combinatorics and Algebra.
His studies deal with areas such as Unrestricted grammar, Regulated rewriting and Natural language processing as well as Formal language.
Arto Salomaa has included themes like Mathematics education and Generative power in his Regulated rewriting study.
His study on Regular language also encompasses disciplines like
- Concurrency and Property most often made with reference to Finite-state machine,
- Calculus which intersects with area such as Mathematical proof.
His most cited work include:
- Handbook of Formal Languages (1727 citations)
- Formal Languages (1531 citations)
- Public-Key Cryptography (952 citations)
What are the main themes of his work throughout his whole career to date?
Arto Salomaa mainly focuses on Discrete mathematics, Theoretical computer science, Algebra, Formal language and Regular language.
His Discrete mathematics research includes elements of Finite-state machine, Automaton and Combinatorics.
His Theoretical computer science study deals with DNA computing intersecting with Turing machine.
His work deals with themes such as Context-free language, Linguistics and Artificial intelligence, which intersect with Formal language.
His Regular language research integrates issues from Characterization and Programming language, Cone.
The concepts of his Decidability study are interwoven with issues in Equivalence and Decision problem.
He most often published in these fields:
- Discrete mathematics (28.06%)
- Theoretical computer science (17.51%)
- Algebra (13.91%)
What were the highlights of his more recent work (between 2005-2021)?
- Discrete mathematics (28.06%)
- Membrane computing (4.56%)
- Parikh matrix (3.36%)
In recent papers he was focusing on the following fields of study:
The scientist’s investigation covers issues in Discrete mathematics, Membrane computing, Parikh matrix, Combinatorics and Algebra.
His work in the fields of Discrete mathematics, such as Fibonacci number, overlaps with other areas such as Reaction system.
His Membrane computing research is classified as research in Theoretical computer science.
His study in the fields of State complexity and Regular language under the domain of Theoretical computer science overlaps with other disciplines such as Combined operations.
His biological study spans a wide range of topics, including Context-free language, Deterministic pushdown automaton and Truth function.
The study incorporates disciplines such as Model checking, Boolean circuit and Formal language in addition to Semantics.
Between 2005 and 2021, his most popular works were:
- The Oxford Handbook of Membrane Computing (648 citations)
- Semirings, Automata, Languages (397 citations)
- DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series) (107 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Algebra
- Algorithm
Arto Salomaa spends much of his time researching Discrete mathematics, Parikh matrix, Word, Arithmetic and Theoretical computer science.
His work in the fields of Discrete mathematics, such as Decidability, intersects with other areas such as Reaction system.
His work investigates the relationship between Decidability and topics such as Special case that intersect with problems in Sequence and Automata theory.
His research investigates the connection with Word and areas like Inference which intersect with concerns in Ambiguity.
Arto Salomaa has researched Arithmetic in several fields, including Value, Polynomial and Arithmetic function.
His work on Regular language and State complexity as part of general Theoretical computer science research is frequently linked to Combined operations, thereby connecting diverse disciplines of science.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
