ANALYSE-SYNTHESE-PROBLEME BEI LINEAREN NICHTDETERMINISTISCHEN AUTOMATEN = PROBLEMES D'ANALYSE-SYNTHESE DES AUTOMATES LINEAIRES NON DETERMINISTESJUNG U.1979; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DDR; DA. 1979; VOL. 15; NO 8-9; PP. 413-433; ABS. RUS/ENG; BIBL. 7 REF.Article

FINITE AUTOMATA HAVING COST FUNCTIONS: NONDETERMINISTIC MODELS.IBARAKI T.1978; INFORM. AND CONTROL; U.S.A.; DA. 1978; VOL. 37; NO 1; PP. 40-69; BIBL. 12 REF.Article

VISITS, CROSSES, AND REVERSALS FOR NONDETERMINISTIC OFF-LINE MACHINES.GREIBACH SA.1978; INFORM. AND CONTROL; U.S.A.; DA. 1978; VOL. 36; NO 2; PP. 174-216; BIBL. 26 REF.Article

THREE WRITE HEADS ARE AS GOOD AS KBRANDENBURG FJ.1981; MATH. SYST. THEORY; ISSN 0025-5661; DEU; DA. 1981; VOL. 14; NO 1; PP. 1-12; BIBL. 8 REF.Article

AMOUNTS OF NONDETERMINISM IN FINITE AUTOMATAKINTALA CMR; WUTSCHKE D.1980; ACTA INFORMAT.; DEU; DA. 1980; VOL. 13; NO 2; PP. 199-204; BIBL. 4 REF.Article

AEQUIVALENZ UND REDUKTION BEI LINEAREN NICHTDETER-MINISTISCHEN AUTOMATEN = EQUIVALENCE ET REDUCTION PAR LES AUTOMATES LINEAIRES NON DETERMINISTESJUNG U.1979; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DDR; DA. 1979; VOL. 15; NO 4; PP. 197-212; ABS. RUS/ENG; BIBL. 9 REF.Article

ANALYSE UND SYNTHESE VON ASYNCHRONEN ND-AUTOMATEN. = ANALYSE ET SYNTHESE DES AUTOMATES ASYNCHRONES NON DETERMINISTESTARKE PH.1976; THEOR. COMPUT. SCI.; NETHERL.; DA. 1976; VOL. 3; NO 2; PP. 261-266; BIBL. 6 REF.Article

ON ATTERNATION. II: A GRAPH THEORETIC APPROACH TO DETERMINISM VERSUS NONDETERMINISMPAUL W; REISCHUK R.1980; ACTA INF.; ISSN 0001-5903; DEU; DA. 1980; VOL. 14; NO 4; PP. 391-403; BIBL. 13 REF.Article

AN OBSERVATION CONCERNING THE COMPLEXITY OF PROBLEMS WITH FEW SOLUTIONS AND ITS APPLICATION TO CRYPTOGRAPHYEVEN S; YACOBI Y.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 100; PP. 270-278; BIBL. 11 REF.Conference Paper

A NOTE ON FINITE-VALUED AND FINITELY AMBIGUOUS TRANSDUCERSGURARI EM; IBARRA OH.1983; MATHEMATICAL SYSTEMS THEORY; ISSN 0025-5661; DEU; DA. 1983; VOL. 16; NO 1; PP. 61-66; BIBL. 12 REF.Article

RELATIVIZING TIME, SPACE, AND TIME-SPACEBOOK RV; WILSON CB; MEI RUI X et al.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 3; PP. 571-581; BIBL. 17 REF.Article

SOME RESULTS ON RELATIVIZED DETERMINISTIC AND NONDETERMINISTIC TIME HIERARCHIESMORAN S.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 1; PP. 1-8; BIBL. 10 REF.Article

TWO-WAY DETERMINISTIC FINITE AUTOMATA ARE EXPONENTIALLY MORE SUCCINCT THAN SWEEPING AUTOMATAMICALI S.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 2; PP. 103-105; BIBL. 4 REF.Article

A NOTE ON THE RETURN COMPLEXITYWECHSUNG G.1980; ELEKTRON. INFORMATIONSVERARB. KYBERN.; ISSN 0013-5712; DDR; DA. 1980; VOL. 16; NO 4; PP. 139-146; ABS. GER/RUS; BIBL. 7 REF.Article

A SIMULATION RESULT FOR THE AUXILIARY PUSHDOWN AUTOMATAHARJU T.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 19; NO 2; PP. 119-132; BIBL. 6 REF.Article

NP-COMPLETE DECISION PROBLEMS FOR BINARY QUADRATICS.MANDERS KL; ADLEMAN L.1978; J. COMPUTER SYST. SCI.; USA; DA. 1978; VOL. 16; NO 2; PP. 168-184; BIBL. 18 REF.Article

SINGLE-VALUED A-TRANSDUCERS.BLATTNER M; HEAD T.1977; J. COMPUTERS SYST. SCI.; U.S.A.; DA. 1977; VOL. 15; NO 3; PP. 310-327; BIBL. 7 REF.Article

2DST MAPPINGS ON LANGUAGES AND RELATED PROBLEMSIBARRA OH.1982; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1982; VOL. 19; NO 2; PP. 219-227; BIBL. 27 REF.Article

LANGUAGES SIMULTANEOUSLY COMPLETE FOR ONE-WAY AND TWO-WAY LOGTAPE AUTOMATAHARTMANIS J; MAHANEY S.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 2; PP. 383-390; BIBL. 11 REF.Article

PROBABILISTIC TWO-WAY MACHINESFREIVALDS R.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 33-45; BIBL. 30 REF.Conference Paper

AN EXTENSION OF SAVITCH'S THEOREM TO SMALL SPACE BOUNDSTOMPA M.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 2; PP. 106-108; BIBL. 3 REF.Article

INVARIANT RELATIONS FOR AUTOMATA - A PROPOSALGOSSEL M; POSCHEL R.1980; ELEKTRON. INFORMATIONSVERARB. KYBERN.; ISSN 0013-5712; DDR; DA. 1980; VOL. 16; NO 4; PP. 147-169; ABS. GER/RUS; BIBL. 14 REF.Article

LOWER BOUNDS ON THE SIZE OF SWEEPING AUTOMATASIPSER M.1980; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1980; VOL. 21; NO 2; PP. 195-202; BIBL. 8 REF.Article

ON ALTERNATIONPAUL WJ; PRAUSS EJ; REISCHUK R et al.1980; ACTA INF.; ISSN 0001-5903; DEU; DA. 1980; VOL. 14; NO 3; PP. 243-255; BIBL. 14 REF.Article

A RECURRENCE FORMULA FOR THE CONFIGURATION TRANSITION RELATION OF A NON DETERMINISTIC CELLULAR AUTOMATON AND ITS APPLICATION TO THE GARDEN OF EDEN PROBLEMYANASE T; INAGAKI Y; FUKUMURA T et al.1979; SYST., COMPUT., CONTROLS; ISSN 0096-8765; USA; DA. 1979 PUBL. 1981; VOL. 10; PP. 65-73; BIBL. 6 REF.Article