ESR Refining Potential for Titanium Alloys using a CaF2‐based Active Slag

Since the end of the Cold War and due to the needs to produce titanium more cost‐efficient and thus more attractive for its civilian use, the electroslag remelting (ESR) process has become an increasingly important topic of international research programmes, because titanium and titanium aluminides can be chemically refined by ESR in some degree. Using ESR, titanium turnings from machining steps and scrap from foundries can be remelted, refined and provided as secondary titanium for the market at relatively favourable prices. This article investigates the removability of the main impurities out of titanium and titanium‐aluminium alloys by electroslag remelting using the active slag system CaF₂‐Ca‐(CaO). Thermochemical and kinetic aspects of the ESR process are considered.     

Increasing the Complexity of Magnetic Core/Shell Structured Nanocomposites for Biological Applications

This Review article ponders core/shell structured nanoparticles that can be prepared with features that combine properties of different materials, including ligands that enhance their biocompatibility. These nanocomposites are not classified in terms of synthesis, but rather by how these features are distributed in the final morphology, attending to connected or isolated materials that end up in interacting or not‐interacting functionalities. In particular, we have focused on magnetic core/shell‐structured particles with a directly connected, coupled, or isolated second functionality. The current progress on methods in colloidal solution that have allowed the great development of these multifunctional magnetic and active spheres on biological and biomedical fields is reported.     

Deterministic finite automata with recursive calls and DPDAs

We study deterministic finite automata (DFA) with recursive calls, that is, finite sequences of component DFAs that can call each other recursively. DFAs with recursive calls are akin to recursive state machines and unrestricted hierarchic state machines. We show that they are language equivalent to deterministic pushdown automata (DPDA).