The following pages link to Bala Ravikumar (Q1019720):
Displaying 50 items.
- (Q293162) (redirect page) (← links)
- A simplified NP-complete MAXSAT problem (Q293164) (← links)
- Weak minimization of DFA -- an algorithm and applications (Q703502) (← links)
- Some classes of languages in \(NC^ 1\) (Q756426) (← links)
- Coping with known patterns of lies in a search game (Q797505) (← links)
- On some variations of two-way probabilistic finite automata models (Q880179) (← links)
- On bounded languages and reversal-bounded automata (Q899318) (← links)
- Bounds on the size of test sets for sorting and related networks (Q910215) (← links)
- Decimations of languages and state complexity (Q1019721) (← links)
- State complexity of unique rational operations (Q1019724) (← links)
- On pebble automata (Q1088408) (← links)
- Some observations concerning alternating Turing machines using small space (Q1097697) (← links)
- Erratum to: Some observations concerning alternating Turing machines using small space (Q1097698) (← links)
- Some subclasses of context-free languages in \(NC^ 1\) (Q1112610) (← links)
- Chaotic dynamics in a cash-in-advance economy (Q1128958) (← links)
- A note on the space complexity of some decision problems for finite automata (Q1183428) (← links)
- Strong nondeterministic Turing reduction - a technique for proving intractability (Q1262762) (← links)
- Productive government expenditures and long-run growth (Q1351036) (← links)
- On counting functions of languages (Q1622992) (← links)
- Peg-solitaire, string rewriting systems and finite automata (Q1885909) (← links)
- Competitive equilibrium and public investment plans (Q1960709) (← links)
- Minimum-cost delegation in service composition (Q2378522) (← links)
- Efficient implementation of algorithms for approximate exponentiation (Q2380060) (← links)
- Opting out of publicly provided services: a majority voting result (Q2386267) (← links)
- On counting functions and slenderness of languages (Q2422037) (← links)
- On partially blind multihead finite automata. (Q2490819) (← links)
- Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation (Q3034835) (← links)
- (Q3059021) (← links)
- ON THE EXISTENCE OF LOOKAHEAD DELEGATORS FOR NFA (Q3065610) (← links)
- On Approximating Non-regular Languages by Regular Languages (Q3100930) (← links)
- (Q3313653) (← links)
- (Q3378271) (← links)
- Entrepreneurship, Organization Capital, and the Evolution of the Firm (Q3399919) (← links)
- (Q3505127) (← links)
- THE BENFORD-NEWCOMB DISTRIBUTION AND UNAMBIGUOUS CONTEXT-FREE LANGUAGES (Q3538858) (← links)
- Weak Minimization of DFA — An Algorithm and Applications (Q3559776) (← links)
- On Some Variations of Two-Way Probabilistic Finite Automata Models (Q3617082) (← links)
- (Q3742754) (← links)
- (Q3786002) (← links)
- (Q3811706) (← links)
- Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties (Q3811712) (← links)
- THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET (Q3988841) (← links)
- (Q4036599) (← links)
- (Q4246722) (← links)
- (Q4256643) (← links)
- Minimal NFA Problems are Hard (Q4277533) (← links)
- Robust Wald Tests in Sur Systems with Adding-up Restrictions (Q4530977) (← links)
- Optimal auditing and insurance in a dynamic model of tax compliance (Q4683686) (← links)
- (Q4808665) (← links)
- On Bounded Languages and Reversal-Bounded Automata (Q4910475) (← links)