In memoriam Chandra Kintala

DOI10.1142/S0129054112400011MaRDI QIDQ2909177zbMATH OpenOpenAlexFDO

Authors Martin Kappes, Andreas Malcher, Detlef Wotschke

Publication date 30 August 2012

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054112400011

zbMATH Keywords

limited nondeterminismdescriptional complexityformal languagessoftware reliability

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Biographies, obituaries, personalia, bibliographies (01A70) History of computer science (68-03) Descriptive complexity and finite models (68Q19)

Recommendations

• Remembering Chandra Kintala
• Preface. Dedicated to the memory of Professor Manfred Kudlek.
• Editorial: Complexity and approximation: in honor of Ker-I Ko
• Preface
• Computer Science Logic

Cites work

• A note on the succinctness of descriptions of deterministic languages
• Cellular automata with sparse communication
• Communication complexity method for measuring nondeterminism in finite automata
• Concise representations of regular languages by degree and probabilistic finite automata
• Constructible functions in cellular automata and their applications to hierarchy results
• DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
• Determination of finite automata accepting subregular languages
• Deterministic Turing machines in the range between real-time and linear-time.
• Economy of description by parsers, DPDA's, and PDA's
• Finite automata and unary languages
• Finite turns and the regular closure of linear context-free languages
• Measures of nondeterminism for pushdown automata
• Measuring nondeterminism in pushdown automata
• Multiple-entry finite automata
• On finite automata with limited nondeterminism
• On measuring nondeterminism in regular languages
• On one-way one-bit O (one)-message cellular automata
• On parsing LL-languages
• On the Amount of Nondeterminism and the Power of Verifying
• On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
• On the relation between ambiguity and nondeterminism in finite automata
• On the size of parsers and \(\text{LR}(k)\)-grammars
• On two-way communication in cellular automata with a fixed number of cells
• Optimal simulations between unary automata
• Pumping and pushdown machines
• Pushdown automata with bounded nondeterminism and bounded ambiguity
• Real-time computations with restricted nondeterminism
• Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations
• Refining nondeterminism in context-free languages
• Regulated nondeterminism in pushdown automata
• Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
• Semantics of context-free languages
• Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
• Size/lookahead tradeoff for \(LL(k)\)-grammars
• Some remarks on multiple-entry finite automata
• Sublinearly space bounded iterative arrays
• Sublogarithmic ambiguity
• Succinct representations of languages by DFA with different levels of reliability
• Succinctness of Descriptions of Unambiguous Context-Free Languages

Cited in

(4)

• In memoriam P. R. Krishnaiah (1932-1987)
• Rajeev Motwani (1962-2009)
• Remembering Chandra Kintala
• Computer Science Logic

This page was built for publication: In memoriam Chandra Kintala

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909177)