Notice: Unexpected clearActionName after getActionName already called in /var/www/html/includes/context/RequestContext.php on line 338
Bala Ravikumar - MaRDI portal

Bala Ravikumar

From MaRDI portal
(Redirected from Person:293162)
Person:1019720

Available identifiers

zbMath Open ravikumar.balaMaRDI QIDQ1019720

List of research outcomes

PublicationDate of PublicationType
On counting functions and slenderness of languages2019-06-18Paper
On counting functions of languages2018-11-22Paper
Optimal auditing and insurance in a dynamic model of tax compliance2018-09-21Paper
A simplified NP-complete MAXSAT problem2016-06-09Paper
On bounded languages and reversal-bounded automata2015-12-28Paper
SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS2015-04-23Paper
An Improved Upper-Bound for Rivest et al.’s Half-Lie Problem2014-04-16Paper
On the Parikh Membership Problem for FAs, PDAs, and CMs2014-03-31Paper
Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages2013-08-07Paper
Some Decision Questions Concerning the Time Complexity of Language Acceptors2013-06-28Paper
On Bounded Languages and Reversal-Bounded Automata2013-03-18Paper
On Approximating Non-regular Languages by Regular Languages2011-11-22Paper
ON THE EXISTENCE OF LOOKAHEAD DELEGATORS FOR NFA2011-01-06Paper
https://portal.mardi4nfdi.de/entity/Q30590212010-12-08Paper
Weak Minimization of DFA — An Algorithm and Applications2010-05-07Paper
Efficient implementation of algorithms for approximate exponentiation2010-03-24Paper
Entrepreneurship, Organization Capital, and the Evolution of the Firm2010-01-15Paper
Decimations of languages and state complexity2009-06-04Paper
State complexity of unique rational operations2009-06-04Paper
On Some Variations of Two-Way Probabilistic Finite Automata Models2009-03-26Paper
Minimum-cost delegation in service composition2009-01-08Paper
THE BENFORD-NEWCOMB DISTRIBUTION AND UNAMBIGUOUS CONTEXT-FREE LANGUAGES2008-11-24Paper
https://portal.mardi4nfdi.de/entity/Q35051272008-06-18Paper
Deterministic Simulation of a NFA with k–Symbol Lookahead2008-03-07Paper
On some variations of two-way probabilistic finite automata models2007-05-11Paper
On partially blind multihead finite automata.2006-05-18Paper
https://portal.mardi4nfdi.de/entity/Q33782712006-03-30Paper
Opting out of publicly provided services: a majority voting result2005-08-22Paper
Weak minimization of DFA -- an algorithm and applications2005-01-11Paper
Peg-solitaire, string rewriting systems and finite automata2004-11-12Paper
https://portal.mardi4nfdi.de/entity/Q48086652004-08-12Paper
Robust Wald Tests in Sur Systems with Adding-up Restrictions2002-05-28Paper
https://portal.mardi4nfdi.de/entity/Q49422372000-10-15Paper
MINIMUM CONSUMPTION REQUIREMENTS: THEORETICAL AND QUANTITATIVE IMPLICATIONS FOR GROWTH AND DISTRIBUTION2000-03-19Paper
Competitive equilibrium and public investment plans2000-01-12Paper
https://portal.mardi4nfdi.de/entity/Q42566431999-08-08Paper
https://portal.mardi4nfdi.de/entity/Q42467221999-06-16Paper
Chaotic dynamics in a cash-in-advance economy1998-08-13Paper
Productive government expenditures and long-run growth1997-02-27Paper
Public investment in infrastructure in a simple growth model1997-02-27Paper
Public investment in infrastructure in a simple growth model1995-06-12Paper
Minimal NFA Problems are Hard1994-02-07Paper
https://portal.mardi4nfdi.de/entity/Q40365991993-05-18Paper
A note on the space complexity of some decision problems for finite automata1992-06-28Paper
THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET1992-06-28Paper
Some classes of languages in \(NC^ 1\)1991-01-01Paper
Bounds on the size of test sets for sorting and related networks1990-01-01Paper
Strong nondeterministic Turing reduction - a technique for proving intractability1989-01-01Paper
Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation1989-01-01Paper
Erratum to: Some observations concerning alternating Turing machines using small space1988-01-01Paper
Some subclasses of context-free languages in \(NC^ 1\)1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38117061988-01-01Paper
Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties1988-01-01Paper
Some observations concerning alternating Turing machines using small space1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37860021987-01-01Paper
On pebble automata1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37427541986-01-01Paper
Coping with known patterns of lies in a search game1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33136531982-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Bala Ravikumar