Remembering Chandra Kintala

  title={Remembering Chandra Kintala},
  author={Martin Kappes and Andreas Malcher and Detlef Wotschke},
With this contribution we would like to remember Chandra M. R. Kintala who passed away in November 2009. We will give short overviews of his CV and his contributions to the field of theoretical and applied computer science and, given the opportunity, will attempt to present the current state of limited nondeterminism and limited resources for machines. Finally, we will briefly touch on some research topics which hopefully will be addressed in the not so distant future. 

Two-way finite automata with restricted nondeterminism and descriptional complexity Internship report −

Acknowledgements : many thanks to professor Giovanni Pighizzini for its welcome and for having directed my internship. Many thanks also to Carlo Mereghetti and Beatrice Palano and all organizing



Limited nondeterminism

Yes, the lucky 13th column is here, and it is a guest column written by J. Goldsmith, M. Levy, and M. Mundhenk on the topic of limited nondeterminism---classes and hierarchies derived when

Measures of Nondeterminism for Pushdown Automata

Computations with a restricted number of nondeterministic steps (Extended Abstract)

This paper directs its efforts towards viewing nondeterminism as an additional resource at the disposal of time or space bounded Turing machine computations and study the classes of languages acceptable by these machines with restricted amounts of nond determinism.

On the Amount of Nondeterminism and the Power of Verifying

Systematic techniques are developed to construct natural complete languages for the classes defined by the "guess-then-check" model GC, which improves a number of previous results in the study of limited nondeterminism.

Descriptional Complexity of Machines with Limited Resources

The goal here is to provide a survey of results on descriptional complexity of machines with limited resources for various types of finite state machines, pushdown automata, parsers and cellu- lar automata and on the effect it has on theirdescriptional complexity.

Restarting Automata and Their Relations to the Chomsky Hierarchy

  • F. Otto
  • Computer Science
    Developments in Language Theory
  • 2003
A survey on the various models of restarting automata and their properties is given, their relationships to the language classes of the Chomsky hierarchy are described, and some open problems are presented.

Refining Nondeterminism below Linear-Time

Fischer and Kintala showed an infinite nondeterministic hierarchy of properly included real-time languages between the deterministic languages and the logbounded nondetergetic languages, which is extended to time complexities in the range between real time and linear time and generalized to arbitrary dimensions.

Pumping and Pushdown Machines

A new technique for proving that certain languages are not accepted by any pushdown machine of a specific type is presented, which combines context-free pumping lemmas with the Floydian view of pushdown machines as transition systems or finite-state machines to give machine-based pumpingLemmas.

On Interacting Automata with Limited Nondeterminism

A speed-up result that allows any linear-time computation to be sped-up to real-time is proved and strong closure properties of languages acceptable with a constant number of nondeterministic transitions are proved.