IN MEMORIAM CHANDRA KINTALA (Q2909177): Difference between revisions

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

Revision as of 15:25, 5 July 2024

scientific article
Language Label Description Also known as
English
IN MEMORIAM CHANDRA KINTALA
scientific article

    Statements

    IN MEMORIAM CHANDRA KINTALA (English)
    0 references
    0 references
    0 references
    0 references
    30 August 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    descriptional complexity
    0 references
    limited nondeterminism
    0 references
    formal languages
    0 references
    software reliability
    0 references