Author of the publication

Decision procedures for families of deterministic pushdown automata.

. University of Warwick, Coventry, UK, (1973)British Library, EThOS.

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Expressiveness of matchgates.. Theor. Comput. Sci., 289 (1): 457-471 (2002)A Note on the Succinctness of Descriptions of Deterministic Languages. Inf. Control., 32 (2): 139-145 (October 1976)The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata. Inf. Control., 25 (2): 123-133 (June 1974)The Decidability of Equivalence for Deterministic Finite-Turn Pushdown Automata. STOC, page 27-32. ACM, (1974)On Non-linear Lower Bounds in Computational Complexity. STOC, page 45-53. ACM, (1975)Knowledge Infusion: In Pursuit of Robustness in Artificial Intelligence.. FSTTCS, volume 2 of LIPIcs, page 415-422. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2008)Managing Complexity in Neurodial Circuits.. ALT, volume 1160 of Lecture Notes in Computer Science, page 1-11. Springer, (1996)The Hippocampus as a Stable Memory Allocator for Cortex.. Neural Comput., 24 (11): 2873-2899 (2012)A Computational Model for Cognition (Abstract).. IFIP Congress (1), volume A-51 of IFIP Transactions, page 234. North-Holland, (1994)Parallelism in Comparison Problems. SIAM Journal on Computing, 4 (3): 348--355 (September 1975)