Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("AUTOMATE DETERMINISTE")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 961

  • Page / 39

Export

Selection :

  • and

EINDEUTIGE UMKEHRBARKEIT DES VERHALTENS ASYNCHRONER ND-AUTOMATEN. = INVERSIBILITE UNIQUE DU COMPORTEMENT DES AUTOMATES ASYNCHRONES NON DETERMINISTESGRABOWSKI J.1974; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1974; VOL. 10; NO 2-3; PP. 109-122; ABS. ANGL. RUSSE; BIBL. 11 REF.Article

TRANSFORMATIONEN VON PARTIELLEN AUTOMATEN = TRANSFORMATIONS D'AUTOMATES PARTIELSMUNTEFERING P.1972; ELEKTRON. INFOR.-VERARBEIT. KYBERN.; DTSCH.; DA. 1972; VOL. 8; NO 5; PP. 269-273; ABS. ANGL. RUSSE; BIBL. 3 REF.Serial Issue

SOME REMARKS ON THE EXTENSION OF A FINITE SET OF STOCHASTIC AUTOMATA.JANICKI S; SZYNAL D.1975; ZASTOSOW. MAT.; POLSKA; DA. 1975; VOL. 14; NO 4; PP. 549-564; ABS. POL.; BIBL. 14 REF.Article

SIMULATION ENDLICHER AUTOMATEN DURCH KETTEN AUS EINFACHEN BAUSTEINAUTOMATEN. = SIMULATION D'AUTOMATES FINIES AU MOYEN DE CHAINES D'AUTOMATES ELEMENTAIRES DE TYPE MODULAIREKOERBER P; OTTMANN T.1974; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1974; VOL. 10; NO 2-3; PP. 133-148; ABS. ANGL. RUSSE; BIBL. 3 REF.Article

THEORIE DER DETERMINIERTEN ZEITVARIABLEN AUTOMATEN. = THEORIE DES AUTOMATES DETERMINISTES VARIABLES DANS LE TEMPSDAUSCHA W; NURNBERG G; STARKE PH et al.1973; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1973; VOL. 9; NO 7-8; PP. 455-511; ABS. ANGL. RUSSE; BIBL. 12 REF.Article

ON 3-HEARD VERSUS 2-HEAD FINITE AUTOMATA.IBARRA OH; KIM CE.1975; ACTA INFORMAT.; ALLEM.; DA. 1975; VOL. 4; NO 2; PP. 193-100; BIBL. 5 REF.Article

PREDECESSOR MACHINES. = MACHINES DE PRECEDENCEFISCHER PC.1974; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1974; VOL. 8; NO 2; PP. 190-219; BIBL. 10 REF.Article

OPTIMALSTEUERUNG MIT DIGITAL-ARBEITENDEN SYSTEMEN. = COMMANDE OPTIMALE AVEC DES SYSTEMES FONCTIONNANT NUMERIQUEMENTFELLBERG G.1974; Z. ELEKTR. INFORM.-U. ENERGIETECH.; DTSCH.; DA. 1974; VOL. 4; NO 6; PP. 350-352; BIBL. 3 REF.Article

UBER DIE EXPERIMENTMENGEN DETERMINIERTER AUTOMATEN = SUR LES AUTOMATES DETERMINISTESSTARKE PH.1972; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1972; VOL. 8; NO 2-3; PP. 67-76; ABS. ANGL., RUSSE; BIBL. 3 REF.Serial Issue

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

RELATIONSHIPS BETWEEN PUSHDOUN AUTOMATA WITH COUNTERS AND COMPLEXITY CLASSES.MONIEN B.1975; MATH. SYST. THEORY; U.S.A.; DA. 1975; VOL. 9; NO 3; PP. 248-264; BIBL. 13 REF.Article

AUTOMATENTHEORETISCHE UND AUTOMATENFREIE CHARAKTERISIERUNGEN TOPOLOGISCHER KLASSEN REGULAERER FOLGENMENGEN. = CARACTERISATIONS DES CLASSES TOPOLOGIQUES D'ENSEMBLES DE SUITES REGULIERES PAR DES METHODES DE LA THEORIE DES AUTOMATES OU INDEPENDANTES DE CELLE-CISTAIGER L; WAGNER K.1974; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1974; VOL. 10; NO 7; PP. 379-392; ABS. ANGL. RUSSE; BIBL. 8 REF.Article

BESCHREIBURG VON ZEITKOMPLEXITAETSKLASSEN BEI TURINGMASCHINEN DURCH ANDERE AUTOMATENMODELLE. = DESCRIPTION DES CLASSES DE COMPLEXITE TEMPORELLE DES MACHINES DE TUERING AU MOYEN D'AUTRES MODELES D'AUTOMATESMONIEN B.1974; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1974; VOL. 10; NO 1; PP. 37-51; ABS. ANGL. RUSSE; BIBL. 8 REF.Article

SUR LA CATEGORIE DES AUTOMATES STOCHASTIQUESPEEVA KG.1974; GOD. VISSH. UCHEBRI. ZAVED., PRILOZ. MAT.; BALG.; DA. 1974; VOL. 10; NO 3; PP. 19-28; ABS. RUSSE ANGL.; BIBL. 10 REF.Article

CIRCUITS SEQUENTIELS ANTITONIQUES AUTONOMES. MINIMISATIONSTARODUBTSEV NA.1981; IZV. AKAD. NAUK SSSR, TEH. KIBERN.; ISSN 0002-3388; SUN; DA. 1981; NO 6; PP. 82-86; BIBL. 4 REF.Article

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

VARIOUS KINDS OF AUTOMATA WITH WEIGHTS.MIZUMOTO M; TOYODA J; TANAKA K et al.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 10; NO 2; PP. 219-236; BIBL. 21 REF.Article

THE EQUIVALENCE PROBLEM FOR DETERMINISTIC FINITE-TURN PUSHDOWN AUTOMATA.VALIANT LG.1974; INFORM. AND CONTROL; U.S.A.; DA. 1974; VOL. 25; NO 2; PP. 123-133; BIBL. 6 REF.Article

NOMBRE DE TOURS DE LA TETE A PILE D'UN AUTOMATE MP A DEUX VOIES AVEC MEMOIREBARASHKO AS.1974; KIBERNETICA, U.S.S.R.; S.S.S.R.; DA. 1974; NO 4; PP. 9-14; ABS. ANGL.; BIBL. 6 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

ONE-WAY MULTIHEAD WRITING FINITE AUTOMATA.SUDBOROUGH IH.1976; INFORM. AND CONTROL; U.S.A.; DA. 1976; VOL. 30; NO 1; PP. 1-20; BIBL. 18 REF.Article

ABSTRAKTE KRYPTOGRAPHISCHE MASCHINEN. = MACHINE ABSTRAITE CRYPTOGRAPHIQUEECKER A.1975; ANGEW. INFORMAT.; DTSCH.; DA. 1975; NO 5; PP. 201-205; ABS. ANGL.; BIBL. 8 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

METHODE D'ETUDE ASYMPTOTIQUE DES JEUX D'AUTOMATESGURVICH ET.1975; AVTOMAT. I TELEMEKH.; S.S.S.R.; DA. 1975; NO 2; PP. 80-94; ABS. ANGL.; BIBL. 12 REF.Article

  • Page / 39