Showing papers by "Kamala Krithivasan published in 1988"
21 Dec 1988
TL;DR: This work considers the problem of path-planning for a point mobile automaton in the presence of unknown obstacles in a two dimensional space and presents an algorithm which has better worst case complexity than that of Lumelsky and Stepanov.
Abstract: We consider the problem of path-planning for a point mobile automaton in the presence of unknown obstacles in a two dimensional space We present an algorithm which has better worst case complexity than that of Lumelsky and Stepanov [4], which is the best known at present
9 citations
TL;DR: It is seen that periodically time varying pushdown automata accept exactly the class of context-free languages.
Abstract: Time varying pushdown automata (PDA) are defined and equivalence between two modes of acceptance shown. It is seen that periodically time varying pushdown automata accept exactly the class of context-free languages. Time varying generalized PDA are defined and their equivalence to terminal weighted context free grammars in GNF shown. It is shown that TVGPDA can be simulated by TVPDA. Thus TVPDA give another machine characterization of recursively enumerable sets.
5 citations