### Refine

#### Year of publication

#### Document Type

- Article (5293)
- Working Paper (1579)
- Doctoral Thesis (883)
- Book (766)
- Part of a Book (537)
- Preprint (418)
- Conference Proceeding (345)
- Periodical Parts (310)
- Report (150)
- Other (114)

#### Language

- English (10525) (remove)

#### Keywords

- Deutschland (102)
- Englisch (98)
- Syntax (94)
- new species (71)
- Deutsch (70)
- taxonomy (60)
- USA (57)
- Phonologie (56)
- Semantik (54)
- Geldpolitik (47)

#### Institute

- Physik (1098)
- Medizin (1059)
- Center for Financial Studies (CFS) (722)
- Wirtschaftswissenschaften (622)
- Biochemie und Chemie (497)
- Biowissenschaften (447)
- Geowissenschaften (334)
- Extern (287)
- Informatik (254)
- Rechtswissenschaft (224)

- Money in monetary policy design: monetary cross-checking in the New-Keynesian model (2009)
- In the New-Keynesian model, optimal interest rate policy under uncertainty is formulated without reference to monetary aggregates as long as certain standard assumptions on the distributions of unobservables are satisfied. The model has been criticized for failing to explain common trends in money growth and inflation, and that therefore money should be used as a cross-check in policy formulation (see Lucas (2007)). We show that the New-Keynesian model can explain such trends if one allows for the possibility of persistent central bank misperceptions. Such misperceptions motivate the search for policies that include additional robustness checks. In earlier work, we proposed an interest rate rule that is near-optimal in normal times but includes a cross-check with monetary information. In case of unusual monetary trends, interest rates are adjusted. In this paper, we show in detail how to derive the appropriate magnitude of the interest rate adjustment following a significant cross-check with monetary information, when the New-Keynesian model is the central bank’s preferred model. The cross-check is shown to be effective in offsetting persistent deviations of inflation due to central bank misperceptions. Keywords: Monetary Policy, New-Keynesian Model, Money, Quantity Theory, European Central Bank, Policy Under Uncertainty

- Tax policy, corporations, and capital market effects (2008)
- This dissertation analyzes tax policy, corporations, and capital market effects. First, the Savings Directive, which has left a loophole by providing grandfathering for some securities, is examined. It can be shown that investors are not willing to pay a premium for bonds that are exempt from the withholding rate, so it may be concluded that the supply of existing loopholes is large enough to allow tax evaders to continue evasion at no additional cost. Second, tax neutrality towards alternative financing instruments for corporate investment is a ubiquitous demand in the political debate. However, the magnitude of possible efficiency costs of a departure from tax neutrality is hardly discussed. Against this background, this dissertation discusses the theory of capital structure and provides back-ofthe-envelope calculations of the possible efficiency cost of a tax distortion of the debt-equity decision. Third, the ex-dividend-day effect in relation to the Gennan tax reform of 2000/2001 is discussed. The abolishment of the imputation system allows reinvestigating the size of the exdividend- day effect. I find no structural break in the size of the German ex-dividend-day effect and no evidence of an ex-dividend-day price drop that exceeds the dividend paid. Fourth, an account of the quantitative development of tax legislation in post-war Germany is presented. It can be shown that the legislative output did not increase over the decades and is not affected by a split majority in the upper and lower houses. Finally, it turns out that an increasing fraction of this legislation is passed in December.

- Sublinearly space bounded iterative arrays (2007)
- Iterative arrays (IAs) are a, parallel computational model with a sequential processing of the input. They are one-dimensional arrays of interacting identical deterministic finite automata. In this note, realtime-lAs with sublinear space bounds are used to accept formal languages. The existence of a proper hierarchy of space complexity classes between logarithmic anel linear space bounds is proved. Furthermore, an optimal spacc lower bound for non-regular language recognition is shown. Key words: Iterative arrays, cellular automata, space bounded computations, decidability questions, formal languages, theory of computation

- On non-recursive trade-offs between finite-turn pushdown automata (2004)
- It is shown that between one-turn pushdown automata (1-turn PDAs) and deterministic finite automata (DFAs) there will be savings concerning the size of description not bounded by any recursive function, so-called non-recursive tradeoffs. Considering the number of turns of the stack height as a consumable resource of PDAs, we can show the existence of non-recursive trade-offs between PDAs performing k+ 1 turns and k turns for k >= 1. Furthermore, non-recursive trade-offs are shown between arbitrary PDAs and PDAs which perform only a finite number of turns. Finally, several decidability questions are shown to be undecidable and not semidecidable.

- On one-way cellular automata with a fixed number of cells (2003)
- We investigate a restricted one-way cellular automaton (OCA) model where the number of cells is bounded by a constant number k, so-called kC-OCAs. In contrast to the general model, the generative capacity of the restricted model is reduced to the set of regular languages. A kC-OCA can be algorithmically converted to a deterministic finite automaton (DFA). The blow-up in the number of states is bounded by a polynomial of degree k. We can exhibit a family of unary languages which shows that this upper bound is tight in order of magnitude. We then study upper and lower bounds for the trade-off when converting DFAs to kC-OCAs. We show that there are regular languages where the use of kC-OCAs cannot reduce the number of states when compared to DFAs. We then investigate trade-offs between kC-OCAs with different numbers of cells and finally treat the problem of minimizing a given kC-OCA.

- On two-way communication in cellular automata with a fixed number of cells (2003)
- The effect of adding two-way communication to k cells one-way cellular automata (kC-OCAs) on their size of description is studied. kC-OCAs are a parallel model for the regular languages that consists of an array of k identical deterministic finite automata (DFAs), called cells, operating in parallel. Each cell gets information from its right neighbor only. In this paper, two models with different amounts of two-way communication are investigated. Both models always achieve quadratic savings when compared to DFAs. When compared to a one-way cellular model, the result is that minimum two-way communication can achieve at most quadratic savings whereas maximum two-way communication may provide savings bounded by a polynomial of degree k.

- On the descriptional complexity of iterative arrays (2003)
- The descriptional complexity of iterative arrays (lAs) is studied. Iterative arrays are a parallel computational model with a sequential processing of the input. It is shown that lAs when compared to deterministic finite automata or pushdown automata may provide savings in size which are not bounded by any recursive function, so-called non-recursive trade-offs. Additional non-recursive trade-offs are proven to exist between lAs working in linear time and lAs working in real time. Furthermore, the descriptional complexity of lAs is compared with cellular automata (CAs) and non-recursive trade-offs are proven between two restricted classes. Finally, it is shown that many decidability questions for lAs are undecidable and not semidecidable.

- Minimizing finite automata is computationally hard (2002)
- It is known that deterministic finite automata (DFAs) can be algorithmically minimized, i.e., a DFA M can be converted to an equivalent DFA M' which has a minimal number of states. The minimization can be done efficiently [6]. On the other hand, it is known that unambiguous finite automata (UFAs) and nondeterministic finite automata (NFAs) can be algorithmically minimized too, but their minimization problems turn out to be NP-complete and PSPACE-complete [8]. In this paper, the time complexity of the minimization problem for two restricted types of finite automata is investigated. These automata are nearly deterministic, since they only allow a small amount of non determinism to be used. On the one hand, NFAs with a fixed finite branching are studied, i.e., the number of nondeterministic moves within every accepting computation is bounded by a fixed finite number. On the other hand, finite automata are investigated which are essentially deterministic except that there is a fixed number of different initial states which can be chosen nondeterministically. The main result is that the minimization problems for these models are computationally hard, namely NP-complete. Hence, even the slightest extension of the deterministic model towards a nondeterministic one, e.g., allowing at most one nondeterministic move in every accepting computation or allowing two initial states instead of one, results in computationally intractable minimization problems.

- Descriptional complexity of cellular automata and decidability questions (2001)
- We study the descriptional complexity of cellular automata (CA), a parallel model of computation. We show that between one of the simplest cellular models, the realtime-OCA. and "classical" models like deterministic finite automata (DFA) or pushdown automata (PDA), there will be savings concerning the size of description not bounded by any recursive function, a so-called nonrecursive trade-off. Furthermore, nonrecursive trade-offs are shown between some restricted classes of cellular automata. The set of valid computations of a Turing machine can be recognized by a realtime-OCA. This implies that many decidability questions are not even semi decidable for cellular automata. There is no pumping lemma and no minimization algorithm for cellular automata.