Photoionization of Kr near 4s threshold: II. Intermediate-coupling theory

The Kr 4s-electron photoionization cross section as a function of the exciting-photon energy in the range between 30 eV and 90 eV was calculated using the configuration interaction (CI) technique in intermediate coupling. In the calculations the 4p spin-orbital interaction and corrections due to higher orders of perturbation theory (the so-called Coulomb interaction correlational decrease) were considered. Energies of Kr II states were calculated and agree with spectroscopic data within less than 10 meV. For some of the Kr II states new assignments were suggested on the basis of the largest component among the calculated CI wavefunctions.

Photoionization of Kr near the 4s threshold: I. Experiment and LS coupling theory

Absolute cross sections for the transitions of the Kr atom into the 4s^1 and 4p^4nl states of the Kr^+ ion were measured in the 4s-electron threshold region by photon-induced fluorescence spectroscopy (PIFS). The cross sections for the transitions of the Kr atom into the 4s^1 and 4p^4nl states were also calculated, as well as the 4p^4nln'l' doubly excited states, in the frame of LS-coupling many-body technique. The cross sections of the doubly-excited atomic states were used to illustrate the pronounced contributions of the latter to the photoionization process, evident from the measurements. The comparison of theory and experiment led to conclusions about the origin of the main features observed in the experiment.

Application of inclusive probability theory to heavy ion-atom collisions

Using the independent particle model as our basis we present a scheme to reduce the complexity and computational effort to calculate inclusive probabilities in many-electron collision system. As an example we present an application to K - K charge transfer in collisions of 2.6 MeV Ne{^9+} on Ne. We are able to give impact parameter-dependent probabilities for many-particle states which could lead to KLL-Auger electrons after collision and we compare with experimental values.

Further investigations on doubly excited four-electron ions: beam-foil experiment and MCDF theory

In continuation of our previous work on the quintet transitions 1s2s2p^2 ^5 P-1s2s2p3d ^5 P^0, ^5 D^0, results on other n = 2 - n' = 3 quintet transitions for elements N, 0 and F are presented. Assignments have been established by comparison with Multi-Configuration Dirac-Fock calculations. High spectral resolution on beam-foil spectroscopy was essential for the identification of most of the lines. For some of the quintet lines decay curves were measured, and the lifetimes extracted were found to be in reasonable agreement with MCDF calculations.

CD-Systems of Restarting Automata

Die vorliegende Arbeit behandelt Restartautomaten und Erweiterungen von Restartautomaten. Restartautomaten sind ein Werkzeug zum Erkennen formaler Sprachen. Sie sind motiviert durch die linguistische Methode der Analyse durch Reduktion und wurden 1995 von Jancar, Mráz, Plátek und Vogel eingeführt. Restartautomaten bestehen aus einer endlichen Kontrolle, einem Lese/Schreibfenster fester Größe und einem flexiblen Band. Anfänglich enthält dieses sowohl die Eingabe als auch Bandbegrenzungssymbole. Die Berechnung eines Restartautomaten läuft in so genannten Zyklen ab. Diese beginnen am linken Rand im Startzustand, in ihnen wird eine lokale Ersetzung auf dem Band durchgeführt und sie enden mit einem Neustart, bei dem das Lese/Schreibfenster wieder an den linken Rand bewegt wird und der Startzustand wieder eingenommen wird. Die vorliegende Arbeit beschäftigt sich hauptsächlich mit zwei Erweiterungen der Restartautomaten: CD-Systeme von Restartautomaten und nichtvergessende Restartautomaten. Nichtvergessende Restartautomaten können einen Zyklus in einem beliebigen Zustand beenden und CD-Systeme von Restartautomaten bestehen aus einer Menge von Restartautomaten, die zusammen die Eingabe verarbeiten. Dabei wird ihre Zusammenarbeit durch einen Operationsmodus, ähnlich wie bei CD-Grammatik Systemen, geregelt. Für beide Erweiterungen zeigt sich, dass die deterministischen Modelle mächtiger sind als deterministische Standardrestartautomaten. Es wird gezeigt, dass CD-Systeme von Restartautomaten in vielen Fällen durch nichtvergessende Restartautomaten simuliert werden können und andererseits lassen sich auch nichtvergessende Restartautomaten durch CD-Systeme von Restartautomaten simulieren. Des Weiteren werden Restartautomaten und nichtvergessende Restartautomaten untersucht, die nichtdeterministisch sind, aber keine Fehler machen. Es zeigt sich, dass diese Automaten durch deterministische (nichtvergessende) Restartautomaten simuliert werden können, wenn sie direkt nach der Ersetzung einen neuen Zyklus beginnen, oder ihr Fenster nach links und rechts bewegen können. Außerdem gilt, dass alle (nichtvergessenden) Restartautomaten, die zwar Fehler machen dürfen, diese aber nach endlich vielen Zyklen erkennen, durch (nichtvergessende) Restartautomaten simuliert werden können, die keine Fehler machen. Ein weiteres wichtiges Resultat besagt, dass die deterministischen monotonen nichtvergessenden Restartautomaten mit Hilfssymbolen, die direkt nach dem Ersetzungsschritt den Zyklus beenden, genau die deterministischen kontextfreien Sprachen erkennen, wohingegen die deterministischen monotonen nichtvergessenden Restartautomaten mit Hilfssymbolen ohne diese Einschränkung echt mehr, nämlich die links-rechts regulären Sprachen, erkennen. Damit werden zum ersten Mal Restartautomaten mit Hilfssymbolen, die direkt nach dem Ersetzungsschritt ihren Zyklus beenden, von Restartautomaten desselben Typs ohne diese Einschränkung getrennt. Besonders erwähnenswert ist hierbei, dass beide Automatentypen wohlbekannte Sprachklassen beschreiben.

Lower Bounds for Nonforgetting Restarting Automata and CD-Systems of Restarting Automata

The nonforgetting restarting automaton is a generalization of the restarting automaton that, when executing a restart operation, changes its internal state based on the current state and the actual contents of its read/write window instead of resetting it to the initial state. Another generalization of the restarting automaton is the cooperating distributed system (CD-system) of restarting automata. Here a finite system of restarting automata works together in analyzing a given sentence, where they interact based on a given mode of operation. As it turned out, CD-systems of restarting automata of some type X working in mode =1 are just as expressive as nonforgetting restarting automata of the same type X. Further, various types of determinism have been introduced for CD-systems of restarting automata called strict determinism, global determinism, and local determinism, and it has been shown that globally deterministic CD-systems working in mode =1 correspond to deterministic nonforgetting restarting automata. Here we derive some lower bound results for some types of nonforgetting restarting automata and for some types of CD-systems of restarting automata. In this way we establish separations between the corresponding language classes, thus providing detailed technical proofs for some of the separation results announced in the literature.

On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata

This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS), which both are useful models in computational linguistics. For PCGSs we study two complexity measures called 'generation complexity' and 'distribution complexity', and we prove that a PCGS Pi, for which the generation complexity and the distribution complexity are both bounded by constants, can be transformed into a freely rewriting restarting automaton of a very restricted form. From this characterization it follows that the language L(Pi) generated by Pi is semi-linear, that its characteristic analysis is of polynomial size, and that this analysis can be computed in polynomial time.

CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions

We introduce a new mode of operation for CD-systems of restarting automata by providing explicit enable and disable conditions in the form of regular constraints. We show that, for each CD-system M of restarting automata and each mode m of operation considered by Messerschmidt and Otto, there exists a CD-system M' of restarting automata of the same type as M that, working in the new mode ed, accepts the language that M accepts in mode m. Further, we prove that in mode ed, a locally deterministic CD-system of restarting automata of type RR(W)(W) can be simulated by a locally deterministic CD-system of restarting automata of the more restricted type R(W)(W). This is the first time that a non-monotone type of R-automaton without auxiliary symbols is shown to be as expressive as the corresponding type of RR-automaton.

Theory of laser-induced ultrafast structural changes in solids

The present thesis is a contribution to the study of laser-solid interaction. Despite the numerous applications resulting from the recent use of laser technology, there is still a lack of satisfactory answers to theoretical questions regarding the mechanism leading to the structural changes induced by femtosecond lasers in materials. We provide here theoretical approaches for the description of the structural response of different solids (cerium, samarium sulfide, bismuth and germanium) to femtosecond laser excitation. Particular interest is given to the description of the effects of the laser pulse on the electronic systems and changes of the potential energy surface for the ions. Although the general approach of laser-excited solids remains the same, the potential energy surface which drives the structural changes is calculated with different theoretical models for each material. This is due to the difference of the electronic properties of the studied systems. We use the Falicov model combined with an hydrodynamic method to study photoinduced phase changes in cerium. The local density approximation (LDA) together with the Hubbard-type Hamiltonian (LDA+U) in the framework of density functional theory (DFT) is used to describe the structural properties of samarium sulfide. We parametrize the time-dependent potential energy surface (calculated using DFT+ LDA) of bismuth on which we perform quantum dynamical simulations to study the experimentally observed amplitude collapse and revival of coherent $A_{1g}$ phonons. On the basis of a time-dependent potential energy surface calculated from a non-orthogonal tight binding Hamiltonian, we perform molecular dynamics simulation to analyze the time evolution (coherent phonons, ultrafast nonthermal melting) of germanium under laser excitation. The thermodynamic equilibrium properties of germanium are also reported. With the obtained results we are able to give many clarifications and interpretations of experimental results and also make predictions.

On CD-systems of stateless deterministic R-automata with window size one

We study cooperating distributed systems (CD-systems) of restarting automata that are very restricted: they are deterministic, they cannot rewrite, but only delete symbols, they restart immediately after performing a delete operation, they are stateless, and they have a read/write window of size 1 only, that is, these are stateless deterministic R(1)-automata. We study the expressive power of these systems by relating the class of languages that they accept by mode =1 computations to other well-studied language classes, showing in particular that this class only contains semi-linear languages, and that it includes all rational trace languages. In addition, we investigate the closure and non-closure properties of this class of languages and some of its algorithmic properties.

CD-Systems of Stateless Deterministic R(1)-Automata Governed by an External Pushdown Store

We study cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 that are governed by an external pushdown store. In this way we obtain an automata-theoretical characterization for the class of context-free trace languages.

On Globally Deterministic CD-Systems of Stateless R-Automata with Window Size One

It is known that cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 accept a class of semi-linear languages that properly includes all rational trace languages. Although the component automata of such a CD-system are all deterministic, in general the CD-system itself is not, as in each of its computations, the initial component and the successor components are still chosen nondeterministically. Here we study CD-systems of stateless deterministic restarting automata with window size 1 that are themselves completely deterministic. In fact, we consider two such types of CD-systems, the strictly deterministic systems and the globally deterministic systems.