THEORIES OF AUTOMATA ON OMEGA -TAPES: A SIMPLIFIED APPROACH. = THEORIES DES AUTOMATES SUR OMEGA -PILES: UNE APPROCHE SIMPLIFIEECHOUEKA Y.1974; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1974; VOL. 8; NO 2; PP. 117-141; BIBL. 11 REF.Article

TWO-WAY NESTED STACK AUTOMATA ARE EQUIVALENT TO TWO-WAY STACK AUTOMATA.BEERI C.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 10; NO 3; PP. 317-339; BIBL. 9 REF.Article

ANWENDUNG TOPOLOGISCHER METHODEN IN DER THEORIE DER ND-AUTOMATEN. = APPLICATION DE METHODES TOPOLOGIQUES A LA THEORIE DES AUTOMATES NON DETERMINISTESGRABOWSKI J.1973; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1973; VOL. 9; NO 10; PP. 615-633; ABS. ANGL. RUSSE; BIBL. 21 REF.Article

EIN ANALYSE-SYSTHESE-SATZ FUER LOKAL-ENDLICHE ND-AUTOMATEN. = UN THEOREME D'ANALYSE PAR SYNTHESE POUR LES AUTOMATES NON DETERMINISTES LOCALEMENT FINISGRABOWSKI J.1974; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1974; VOL. 10; NO 7; PP. 393-397; ABS. ANGL. RUSSE; BIBL. 2 REF.Article

METHODE MATRICIELLE POUR IDENTIFIER DES ETATS NON DISTINCTS DE MACHINES SEQUENTIELLES NON DETERMINISTESSZABATIN J.1974; ARCH. AUTOMAT. TELEMECH.; POLSKA; DA. 1974; VOL. 19; NO 1; PP. 89-105; ABS. RUSSE ANGL.; BIBL. 11 REF.Article

MINIMIZATION OF NONDETERMINISTIC FINITE LOCAL AUTOMATAFUJIWARA H; KINOSHITA K.1972; TECHNOL. REP. OSAKA UNIV.; JAP.; DA. 1972; VOL. 22; NO 1027-1052; PP. 227-233; BIBL. 2 REF.Serial Issue

DECHIFFRIERUNG VON ND-AUTOMATEN. = DECHIFFRAGE D'AUTOMATES NON DETERMINISTESWIEHAGEN R.1975; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1975; VOL. 11; NO 1-2; PP. 39-60; ABS. ANGL. RUSSE; BIBL. 7 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

THE COMPLEXITY OF RESTRICTED REGULAR EXPRESSIONS AND THE SYNTHESIS PROBLEM FOR FINITE AUTOMATALEISS E.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 23; NO 3; PP. 348-354; BIBL. 10 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

ZUR STRUKTURTHEORIE ENDLICHER NICHTDETERMINISTISCHER AUTOMATEN. I: ZUM VERBAND DER 1-KONGRUENZEN VON ENDLICHEN RELATIONALSYSTEM = SUR LA THEORIE DE LA STRUCTURE D'AUTOMATES FINIS NON DETERMINISTES SUR LES TREILLIS DE 1-CONGRUENCES DE SYSTEMES RELATIONNELS FINISSTRASSNER K.1981; ELEKTRON. INFORMATIONSVERARB. KYBERN.; ISSN 0013-5712; DDR; DA. 1981; VOL. 17; NO 2-3; PP. 113-120; ABS. ENG/RUS; BIBL. 5 REF.Article

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

DIAGNOSE UND EINSTELLUNG NICHT-DETERMINISTISCHER AUTOMATEN BEI REGULAEREN UNTERSCHEIDUNGSFORMEN. = PROBLEME DU DIAGNOSTIC D'AUTOMATES NON DETERMINISTES PAR DES RELATIONS BINAIRES DE DISTINGUABILITE ENTRE LES MOTS DE SORTIEBURKHARD HD.1974; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1974; VOL. 10; NO 8-9; PP. 455-469; ABS. ANGL. RUSSE; BIBL. 10 REF.Article

MAZE RECOGNIZING AUTOMATA. (EXTENDED ABSTRACT) = AUTOMATE DE RECONNAISSANCE POUR LABYRINTHE (RESUME DETAILLE)SAVITCH WJ.sdIN: 4TH ANNU. ACM SYMP. THEORY COMPUT. DENVER, COLO, 1972. PROC.; S.L.; DA. S.D.; PP. 151-156; BIBL. 3 REF.Conference Paper

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

TURING MACHINES AND THE SPECTRA OF FIRST-ORDER FORMULAS WITH EQUALITYJONES ND; SELMAN AL.sdIN: 4TH ANNU. ACM SYMP. THEORY COMPUT. DENVER, COLO, 1972. PROC.; S.L.; DA. S.D.; PP. 157-167; BIBL. 10 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

RECOGNITION CAPACITY OF FINITE AUTOMATA HAVING ADDITIVE COST FUNCTIONS: NONDETERMINISTIC MODELSMURO S; IBARAKI T; HASEGAWA T et al.1979; SYST. COMPUT. CONTROLS; ISSN 0096-8765; USA; DA. 1979 PUBL. 1981; VOL. 10; NO 4; PP. 21-28; BIBL. 15 REF.Article