IN MEMORIAM CHANDRA KINTALA
From MaRDI portal
Publication:2909177
DOI10.1142/S0129054112400011zbMath1246.01037OpenAlexW2040148069MaRDI QIDQ2909177
Andreas Malcher, Detlef Wotschke, Martin Kappes
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
Formal languages and automata (68Q45) Biographies, obituaries, personalia, bibliographies (01A70) History of computer science (68-03) Descriptive complexity and finite models (68Q19)
Cites Work
- Regulated nondeterminism in pushdown automata
- On measuring nondeterminism in regular languages
- Finite automata and unary languages
- On the relation between ambiguity and nondeterminism in finite automata
- Economy of description by parsers, DPDA's, and PDA's
- Some remarks on multiple-entry finite automata
- On finite automata with limited nondeterminism
- Measures of nondeterminism for pushdown automata
- Pushdown automata with bounded nondeterminism and bounded ambiguity
- On the size of parsers and \(\text{LR}(k)\)-grammars
- Size/lookahead tradeoff for \(LL(k)\)-grammars
- Succinct representations of languages by DFA with different levels of reliability
- On two-way communication in cellular automata with a fixed number of cells
- Multiple-entry finite automata
- Deterministic Turing machines in the range between real-time and linear-time.
- Communication complexity method for measuring nondeterminism in finite automata
- Cellular automata with sparse communication
- Determination of finite automata accepting subregular languages
- Finite turns and the regular closure of linear context-free languages
- Sublogarithmic ambiguity
- Measuring nondeterminism in pushdown automata
- Optimal Simulations between Unary Automata
- On One-way One-bit O (One)-message Cellular Automata
- Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
- SUBLINEARLY SPACE BOUNDED ITERATIVE ARRAYS
- Concise representations of regular languages by degree and probabilistic finite automata
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations
- A note on the succinctness of descriptions of deterministic languages
- Succinctness of Descriptions of Unambiguous Context-Free Languages
- Refining nondeterminism in context-free languages
- Real-time computations with restricted nondeterminism
- Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
- On the Amount of Nondeterminism and the Power of Verifying
- Pumping and pushdown machines
- Semantics of context-free languages
- DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
- Constructible functions in cellular automata and their applications to hierarchy results
- On parsing LL-languages
