Deterministic realization of nondeterministic computations with a low measure of nondeterminism

DOI10.1007/BF01068368zbMath0800.68427MaRDI QIDQ4007372

Ildar R. Nasyrov

Publication date: 27 September 1992

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

Turing machinespushdown automatanondeterministic computations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization of LR(k) parsers
• On-line simulation of k + 1 tapes by k tapes requires nonlinear time
• On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
• A note on finite-valued and finitely ambiguous transducers
• A generalization of context-free determinism

This page was built for publication: Deterministic realization of nondeterministic computations with a low measure of nondeterminism