Author of the publication

Remarks on the Complexity of Nondeterministic Counter Languages.

. Theor. Comput. Sci., 1 (4): 269-288 (1976)

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

Some restrictions onW-grammars.. Int. J. Parallel Program., 3 (4): 289-327 (1974)A Note on NSPACE(log2 n) and Substitution.. RAIRO Theor. Informatics Appl., 11 (2): 127-132 (1977)Single-Tape Reset Machines., and . RAIRO Theor. Informatics Appl., 20 (1): 55-77 (1986)Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract, , and . STOC, page 92-99. ACM, (1970)Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem., and . J. ACM, 27 (4): 675-700 (1980)Complexity of pattern generation via planar parallel binary fission/fusion grammars., , and . Graph-Grammars and Their Application to Computer Science, volume 291 of Lecture Notes in Computer Science, page 515-533. Springer, (1986)Comparisons and Reset Machines (Preliminary Report)., , and . ICALP, volume 62 of Lecture Notes in Computer Science, page 113-124. Springer, (1978)Reset Machines., , and . J. Comput. Syst. Sci., 19 (3): 256-276 (1979)A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors., and . SIAM J. Comput., 11 (1): 166-183 (1982)A Two-Dimensional Generating System Modeling Growth by Binary Cell Division (Preliminary Report), , and . SWAT, page 1-12. IEEE Computer Society, (1974)