The following pages link to Shankara Narayanan Krishna (Q537906):
Displaying 50 items.
- Model checking weighted integer reset timed automata (Q537908) (← links)
- Enhanced mobile membranes: computability results (Q537912) (← links)
- Universality results for P systems based on brane calculi operations (Q870259) (← links)
- Membrane computing with transport and embedded proteins (Q1004081) (← links)
- Perfect timed communication is hard (Q1631220) (← links)
- Further results on generalised communicating P systems (Q1682864) (← links)
- Results on catalytic and evolution-communication P systems (Q1762941) (← links)
- Breaking DES using P systems. (Q1874407) (← links)
- Regular transducer expressions for regular transformations (Q2064527) (← links)
- Regular model checking with regular relations (Q2140498) (← links)
- One-way resynchronizability of word transducers (Q2233399) (← links)
- The decidability of verification under PS 2.0 (Q2233444) (← links)
- On timed scope-bounded context-sensitive languages (Q2327552) (← links)
- P systems with mobile membranes (Q2493231) (← links)
- (Q2729243) (← links)
- (Q2770584) (← links)
- A Logical Characterization for Dense-Time Visibly Pushdown Automata (Q2798712) (← links)
- Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable (Q2799176) (← links)
- Metric Temporal Logic with Counting (Q2811351) (← links)
- A Perfect Class of Context-Sensitive Timed Languages (Q2817374) (← links)
- On the Computability Power of Membrane Systems with Controlled Mobility (Q2904459) (← links)
- On Unary Fragments of MTL and TPTL over Timed Words (Q2938172) (← links)
- On Pure Nash Equilibria in Stochastic Games (Q2948480) (← links)
- First-order definable string transformations (Q2978509) (← links)
- What's decidable about recursive hybrid automata? (Q2988912) (← links)
- Bounded-rate multi-mode systems based motion planning (Q2988914) (← links)
- Computability Power of Mobility in Enhanced Mobile Membranes (Q3091452) (← links)
- On Restricted Bio-Turing Machines (Q3100944) (← links)
- On Construction of Safety Signal Automata for $MITL[\:\mathcal{U},\:\mathcal{S}]$ Using Temporal Projections (Q3172853) (← links)
- Adding Negative Prices to Priced Timed Games (Q3190143) (← links)
- On the Computational Power of Enhanced Mobile Membranes (Q3507447) (← links)
- Updatable Timed Automata with Additive and Diagonal Constraints (Q3507456) (← links)
- Timed Automata with Integer Resets: Language Inclusion and Expressiveness (Q3543291) (← links)
- The Expressiveness of Concentration Controlled P Systems (Q3543336) (← links)
- Communicating Distributed H Systems: Optimal Results with Efficient Ways of Communication (Q3618689) (← links)
- Model Checking Logic WCTL with Multi Constrained Modalities on One Clock Priced Timed Automata (Q3648825) (← links)
- (Q4329026) (← links)
- (Q4330727) (← links)
- (Q4413837) (← links)
- (Q4437099) (← links)
- On power of p systems using sequential and parallel rewriting (Q4528030) (← links)
- Stochastic Timed Games Revisited (Q4608565) (← links)
- Analyzing Timed Systems Using Tree Automata (Q4608679) (← links)
- FO-Definable Transformations of Infinite Strings (Q4636559) (← links)
- (Q4636594) (← links)
- (Q4643961) (← links)
- (Q4681301) (← links)
- (Q4737678) (← links)
- On Some Classes Of Contextual Grammars (Q4805930) (← links)
- (Q4992499) (← links)
