scientific article
From MaRDI portal
Publication:3664434
zbMath0516.68040MaRDI QIDQ3664434
J. Hoperoft, Jeffrey D. Ullman, A. V. Aho
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of software (68N99)
Related Items
A fast algorithm for translating combinator expressions with BC-chains ⋮ Mixed computation of Prolog programs ⋮ Improved heuristics for the minimum weight triangulation problem ⋮ Unnamed Item ⋮ Using automata theory for characterizing the semantics of terminological cycles ⋮ Rational transductions and complexity of counting problems ⋮ Weak parallel machines: A new class of physically feasible parallel machine models ⋮ Merging and sorting strings in parallel ⋮ On testing UML statecharts ⋮ Об одном подходе к разложению иррациональных чисел ⋮ Experiments with automata when the upper bound of the number of their states is unknown ⋮ Parallelization of automata ⋮ Infinite regular Thue systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Simple programming languages and restricted classes of Turing machines ⋮ Quantum model of computations: Underlying principles and achievements
