Publication | Date of Publication | Type |
---|
On counting functions and slenderness of languages | 2019-06-18 | Paper |
On counting functions of languages | 2018-11-22 | Paper |
Optimal auditing and insurance in a dynamic model of tax compliance | 2018-09-21 | Paper |
A simplified NP-complete MAXSAT problem | 2016-06-09 | Paper |
On bounded languages and reversal-bounded automata | 2015-12-28 | Paper |
SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS | 2015-04-23 | Paper |
An Improved Upper-Bound for Rivest et al.’s Half-Lie Problem | 2014-04-16 | Paper |
On the Parikh Membership Problem for FAs, PDAs, and CMs | 2014-03-31 | Paper |
Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages | 2013-08-07 | Paper |
Some Decision Questions Concerning the Time Complexity of Language Acceptors | 2013-06-28 | Paper |
On Bounded Languages and Reversal-Bounded Automata | 2013-03-18 | Paper |
On Approximating Non-regular Languages by Regular Languages | 2011-11-22 | Paper |
ON THE EXISTENCE OF LOOKAHEAD DELEGATORS FOR NFA | 2011-01-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q3059021 | 2010-12-08 | Paper |
Weak Minimization of DFA — An Algorithm and Applications | 2010-05-07 | Paper |
Efficient implementation of algorithms for approximate exponentiation | 2010-03-24 | Paper |
Entrepreneurship, Organization Capital, and the Evolution of the Firm | 2010-01-15 | Paper |
Decimations of languages and state complexity | 2009-06-04 | Paper |
State complexity of unique rational operations | 2009-06-04 | Paper |
On Some Variations of Two-Way Probabilistic Finite Automata Models | 2009-03-26 | Paper |
Minimum-cost delegation in service composition | 2009-01-08 | Paper |
THE BENFORD-NEWCOMB DISTRIBUTION AND UNAMBIGUOUS CONTEXT-FREE LANGUAGES | 2008-11-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q3505127 | 2008-06-18 | Paper |
Deterministic Simulation of a NFA with k–Symbol Lookahead | 2008-03-07 | Paper |
On some variations of two-way probabilistic finite automata models | 2007-05-11 | Paper |
On partially blind multihead finite automata. | 2006-05-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q3378271 | 2006-03-30 | Paper |
Opting out of publicly provided services: a majority voting result | 2005-08-22 | Paper |
Weak minimization of DFA -- an algorithm and applications | 2005-01-11 | Paper |
Peg-solitaire, string rewriting systems and finite automata | 2004-11-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q4808665 | 2004-08-12 | Paper |
Robust Wald Tests in Sur Systems with Adding-up Restrictions | 2002-05-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4942237 | 2000-10-15 | Paper |
MINIMUM CONSUMPTION REQUIREMENTS: THEORETICAL AND QUANTITATIVE IMPLICATIONS FOR GROWTH AND DISTRIBUTION | 2000-03-19 | Paper |
Competitive equilibrium and public investment plans | 2000-01-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q4256643 | 1999-08-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q4246722 | 1999-06-16 | Paper |
Chaotic dynamics in a cash-in-advance economy | 1998-08-13 | Paper |
Productive government expenditures and long-run growth | 1997-02-27 | Paper |
Public investment in infrastructure in a simple growth model | 1997-02-27 | Paper |
Public investment in infrastructure in a simple growth model | 1995-06-12 | Paper |
Minimal NFA Problems are Hard | 1994-02-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q4036599 | 1993-05-18 | Paper |
A note on the space complexity of some decision problems for finite automata | 1992-06-28 | Paper |
THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET | 1992-06-28 | Paper |
Some classes of languages in \(NC^ 1\) | 1991-01-01 | Paper |
Bounds on the size of test sets for sorting and related networks | 1990-01-01 | Paper |
Strong nondeterministic Turing reduction - a technique for proving intractability | 1989-01-01 | Paper |
Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation | 1989-01-01 | Paper |
Erratum to: Some observations concerning alternating Turing machines using small space | 1988-01-01 | Paper |
Some subclasses of context-free languages in \(NC^ 1\) | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3811706 | 1988-01-01 | Paper |
Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties | 1988-01-01 | Paper |
Some observations concerning alternating Turing machines using small space | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3786002 | 1987-01-01 | Paper |
On pebble automata | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3742754 | 1986-01-01 | Paper |
Coping with known patterns of lies in a search game | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3313653 | 1982-01-01 | Paper |