Travelled to:
1 × France
2 × Canada
2 × USA
3 × Spain
Collaborated with:
O.H.Ibarra ∅ X.Xiong T.Jiang
Talks about:
languag (5) problem (4) some (4) concern (3) decis (3) question (2) automata (2) acceptor (2) complex (2) minim (2)
Person: Bala Ravikumar
DBLP: Ravikumar:Bala
Facilitated 2 volumes:
Contributed to:
Wrote 10 papers:
- LATA-2014-IbarraR #on the #problem
- On the Parikh Membership Problem for FAs, PDAs, and CMs (OHI, BR), pp. 14–31.
- CIAA-2013-IbarraR #problem
- Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages (OHI, BR), pp. 193–207.
- DLT-2013-IbarraR #complexity
- Some Decision Questions Concerning the Time Complexity of Language Acceptors (OHI, BR), pp. 264–276.
- DLT-J-2013-IbarraR14 #complexity
- Some Decision Questions Concerning the Time Complexity of Language Acceptors (OHI, BR), pp. 1127–1140.
- LATA-2013-IbarraR #automaton #bound #on the
- On Bounded Languages and Reversal-Bounded Automata (OHI, BR), pp. 359–370.
- DLT-J-2007-Ravikumar08 #ambiguity #context-free grammar
- The Benford-Newcomb Distribution and Unambiguous Context-Free Languages (BR), pp. 717–727.
- DLT-2006-Ravikumar #automaton #finite #modelling #on the #probability
- On Some Variations of Two-Way Probabilistic Finite Automata Models (BR), pp. 443–454.
- CIAA-2003-Ravikumar #algorithm #automaton
- Weak Minimization of DFA — An Algorithm and Applications (BR), pp. 226–238.
- WIA-1996-RavikumarX #implementation #parallel #problem #sequence #source code
- Implementing Sequential and Parallel Programs for the Homing Sequence Problem (BR, XX), pp. 120–131.
- ICALP-1991-JiangR #automaton #nondeterminism #problem
- Minimal NFA Problems Are Hard (TJ, BR), pp. 629–640.