Suche
Anzeige der Dokumente 1-10 von 10
Preprint
On the Descriptional Complexity of Simple RL-Automata
(2006)
Analysis by reduction is a method used in linguistics for checking the correctness of sentences of natural languages.
This method is modelled by restarting automata. Here we study a new type of restarting automaton, the so-called t-sRL-automaton, which is an RL-automaton that is rather restricted in that it has a window of size 1 only, and that it works under a minimal acceptance condition.
On the other hand, it is allowed to perform up to t rewrite (that is, delete) steps per cycle.
We focus on the descriptional ...
Preprint
Exact algorithms for p-adic fields and epsilon constant conjectures
(2006)
We develop several algorithms for computations in Galois extensions of p-adic fields. Our algorithms are based on existing algorithms for number fields and are exact in the sense that we do not need to consider approximations to p-adic numbers. As an application we describe an algorithmic approach to prove or disprove various conjectures for local and global epsilon constants.
Preprint
On the Gap-Complexity of Simple RL-Automata
(2006)
Analysis by reduction is a method used in linguistics for checking the correctness of sentences of natural languages. This method is modelled by restarting automata. All types of restarting automata considered in the literature up to now accept at least the deterministic context-free languages. Here we introduce and study a new type of restarting automaton, the so-called t-RL-automaton, which is an RL-automaton that is rather restricted in that it has a window of size one only, and that it works under a minimal ...
Preprint
Approximate approximations for the Poisson and the Stokes equations
(2006)
The method of approximate approximations is based on generating functions representing an approximate partition of the unity, only. In the present paper this method is used for the numerical solution of the Poisson equation and the Stokes system in R^n (n = 2, 3). The corresponding approximate volume potentials will be computed explicitly in these cases, containing a one-dimensional integral, only. Numerical simulations show the efficiency of the method and confirm the expected convergence of essentially second order, ...
Preprint
Computation of locally free class groups
(2006)
We show that the locally free class group of an order in a semisimple algebra over a number field is isomorphic to a certain ray class group. This description is then used to present an algorithm that computes the
locally free class group. The algorithm is implemented in MAGMA for the case where the algebra is a group ring over the rational numbers.
Preprint
Numerical simulation of tunnel fires using preconditioned finite volume schemes
(2006)
This article is concerned with the numerical simulation of flows at low Mach numbers which are subject to the gravitational force and strong heat sources. As a specific example for such flows, a fire event in a car tunnel will be considered in detail. The low Mach flow is treated with a preconditioning technique allowing the computation of unsteady flows, while the source terms for gravitation and heat are incorporated via operator splitting. It is shown that a first order discretization in space is not able to compute ...
Preprint
Duplication coefficients via generating functions
(2006)
In this paper, we solve the duplication problem P_n(ax) = sum_{m=0}^{n}C_m(n,a)P_m(x) where {P_n}_{n>=0} belongs to a wide class of polynomials, including the classical orthogonal polynomials (Hermite, Laguerre, Jacobi) as well as the classical discrete orthogonal polynomials (Charlier, Meixner, Krawtchouk) for the specific case a = −1. We give closed-form expressions as well as recurrence relations satisfied by the duplication coefficients.
Preprint
5. Krypto-Tag - Workshop über Kryptographie
(2006)
Dieser Tagungsband enthält die gesammelten Zusammenfassungen der acht eingereichten Vorträge des 5. Krypto-Tags. Der Kryptotag ist eine zentrale Aktivität der Fachgruppe "Angewandte Kryptologie" der Gesellschaft für Informatik e.V. Er ist eine wissenschaftliche Veranstaltung im Bereich der Kryptologie und von der organisatorischen Arbeit der Fachgruppe getrennt.
Preprint
Spacelike maximal surfaces in 3D Lorentz-Minkowski space
(2006)
We investigate spacelike maximal surfaces in 3-dimensional Lorentz-Minkowski space,
give an Enneper-Weierstrass representation of such surfaces and classify those with a Lorentzian or Euclidian rotation symmetry.
Preprint
Church-Rosser groups and growing context-sensitive groups
(2006)
A finitely generated group is called a Church-Rosser group (growing context-sensitive group) if it admits a finitely generated presentation for which the word problem is a Church-Rosser (growing context-sensitive) language. Although the Church-Rosser languages are incomparable to the context-free languages under set inclusion, they strictly contain the class of deterministic context-free languages. As each context-free group language is actually deterministic context-free, it follows that all context-free groups are ...