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

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

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

TWO-WAY DETERMINISTIC MULTI-WEAK-COUNTER MACHINESMIYANO S.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 21; NO 1; PP. 27-37; BIBL. 18 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

TWO HEADS ARE BETTER THAN ONE.SHAH AN; ROSENFELD A.1976; INFORM. SCI.; U.S.A.; DA. 1976; VOL. 10; NO 2; PP. 155-158; BIBL. 1 REF.Article

A DIRECT BRANCHING ALGORITHM FOR CHECKING EQUIVALENCE OF SOME CLASSES OF DETERMINISTIC PUSHDOWN AUTOMATATOMITA E.1982; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1982; VOL. 52; NO 2; PP. 187-238; BIBL. 23 REF.Article

MINIMIZATION OF DETERMINISTIC TREE GRAMMARS AND AUTOMATA.BARRERO A; GONZALEZ RC.1976; IN: CONF. DECIS. CONTROL. SYMP. ADAPT. PROCESSES. 15. PROC.; CLEARWATER, FLA.; 1976; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1976; PP. 404-407; BIBL. 8 REF.Conference Paper

UEBER EINIGE GRUNDLAGEN FUER EINE ALLGEMEINE THEORIE DETERMINISTISCHER SYSTEME. = QUELQUES BASES POUR UNE THEORIE GENERALE DES SYSTEMES DETERMINISTESLOCKE M; IHLE E.1978; Z. ELEKTR. INFORM.-U. ENERGIETECH.; DTSCH.; DA. 1978; VOL. 8; NO 1; PP. 51-60; BIBL. 8 REF.Article

ON SOME DECIDABLE PROPERTIES OF FINITE STATE TRANSLATIONSDEMERS A; KELEMAN C; REUSCH B et al.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 17; NO 3; PP. 349-364; BIBL. 13 REF.Article

PROJECTIVE LIMITS IN THE CATEGORIES OF HETEROGENEOUS ALGEBRAS AND ABSTRACT AUTOMATAVASILACH S.1978; R.C. CIRCOLO MAT. PALERME; ITA; DA. 1978 PUBL. 1979; VOL. 27; NO 2; PP. 210-228; BIBL. 3 REF.Article

ALGORITHMS FOR FINDING DIRECTED GRAPH ISOMORPHISM BY FINITE AUTOMATACHAO CHIH YANG; MAY CP.1980; INTERNATION. J. COMPUTER INFORM. SCI.; USA; DA. 1980; VOL. 9; NO 2; PP. 117-140; BIBL. 22 REF.Article

THE LBA-PROBLEM AND THE DETERMINISTIC TOPE COMPLEXITY OF TWO-WAY ONE-COUNTER LANGUAGES OVER A ONE-LETTER ALPHABET.MONIEN B.1977; ACTA INFORM.; ALLEM.; DA. 1977; VOL. 8; NO 4; PP. 371-382; BIBL. 8 REF.Article

A NOTE ON DPDA TRANSDUCTIONS OF (0,1)* AND INVERSE DPDA TRANSDUCTIONS OF THE DYCK SETVITANYI PMB.1981; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1981; VOL. 9; NO 2; PP. 131-137; BIBL. 5 REF.Article

New upper bounds to the limitedness of distance automataHASHIGUCHI, K.Theoretical computer science. 2000, Vol 233, Num 1-2, pp 19-32, issn 0304-3975Article

GENERALIZED IDENTIFICATION EXPERIMENTS FOR FINITE DETERMINISTIC AUTOMATABURKHARD HD.1982; BANACH CENT. PUBL.; ISSN 0137-6934; POL; DA. 1982; VOL. 7; PP. 45-51; BIBL. 6 REF.Article

SIMULATIONS AMONG MULTIDIMENSIONAL TURING MACHINESLOUI MC.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 21; NO 2; PP. 145-161; BIBL. 16 REF.Article

PROPRIETES DE CLOTURE D'UNE EXTENSION DE TRANSDUCTEURS D'ARBRES DETERMINISTESLILIN E.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 112; PP. 280-289; ABS. ENG; BIBL. 8 REF.Conference Paper

SOME REMARKS ON MULTIPLE-ENTRY FINITE AUTOMATAVELOSO PAS; GILL A.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 18; NO 3; PP. 304-306; BIBL. 5 REF.Article

SUPERDETERMINISTIC DPDAS: THE METHOD OF ACCEPTING DOES AFFECT DECISION PROBLEMSFRIEDMAN EP; GREIBACH SA.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 19; NO 1; PP. 79-117; BIBL. 25 REF.Article

CIRCUITS D'AUTOMATES ET APPLICATIONS REALISEES PAR EUXROJTBERG MA.1978; AVTOMAT. I TELEMEKH.; S.S.S.R.; DA. 1978; NO 4; PP. 151-160; ABS. ANGL.; BIBL. 7 REF.Article

VALUED PROBABILISTIC TREE FUNCTIONS.KARPINSKI M.1976; BULL. ACAD. POLON. SCI., SCI. MATH. ASTR. PHYS.; POLOGNE; DA. 1976; VOL. 24; NO 10; PP. 927-930; ABS. RUSSE; BIBL. 7 REF.Article