Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("DETERMINISTIC AUTOMATON")

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 833

  • Page / 34
Export

Selection :

  • and

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

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

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

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

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

PEBBLE MACHINES AND TREE WALKING MACHINESMORIYA T.1982; INFORMATION SCIENCES (NEW YORK); ISSN 0020-0255; USA; DA. 1982; VOL. 27; NO 2; PP. 99-119; BIBL. 12 REF.Article

A DECISION PROCEDURE FOR THE EQUIVALENCE OF TWO DPDAS ONE OF WHICH IS LINEARITZHAIK Y; YEHUDAI A.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 229-237; BIBL. 13 REF.Conference Paper

ON INCLUSION PROBLEM FOR DETERMINISTIC MULTITAPE AUTOMATAKIN BER EB.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 11; NO 3; PP. 144-146; BIBL. 3 REF.Article

ON THE BEHAVIOR OF A LEARNING AUTOMATON IN A CHANGING ENVIRONMENT WITH APPLICATION TO TELEPHONE TRAFFIC ROUTINGNARENDRA KS; THATHACHAR MAL.1980; IEEE TRANS. SYST. MAN CYBERN.; ISSN 0018-9472; USA; DA. 1980; VOL. 10; NO 5; PP. 262-269; BIBL. 11 REF.Article

AUTOMATES DANS LES CATEGORIES. PROBLEME DE DECOMPOSITIONMELIKADZE NL.1980; KIBERNETIKA; UKR; DA. 1980; NO 4; PP. 11-17; BIBL. 9 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

RECONNAISSANCE DES LANGAGES SUR DES AUTOMATES FINIS DETERMINISTES ET PROBABILISTES A TETES MULTIPLESFREJVALD RV.1979; AVTOMAT. VYCHISLIT. TEKH.; SUN; DA. 1979; NO 3; PP. 15-20; BIBL. 6 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

REMARKS ON THE COMPLEXITY OF NONDETERMINISTIC COUNTER LANGUAGES.GREIBACH SA.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 1; NO 4; PP. 269-288; BIBL. 17 REF.Article

INTEGRAL NETS AND FUZZY RELATIONS IN DETERIMISTIC AUTOMATAWARNER MW.1982; KYBERNETIKA; ISSN 0023-5954; CSK; DA. 1982; VOL. 18; NO 1; PP. 22-30; BIBL. 7 REF.Article

SUR QUELQUES PROPRIETES D'UNE CLASSE DE SYSTEMES DE COMMANDE FONCTIONNANT DANS LES MILIEUX ALEATOIRES STATIONNAIRESMUKHIN VI.1980; PROBL. PEREDACHI INFORM.; SUN; DA. 1980; VOL. 16; NO 1; PP. 84-92; BIBL. 12 REF.Article

MACHINES AS ORGANISMS: AN EXPLORATION OF THE RELEVANCE OF RECENT RESULTSLAING R.1979; BIOSYSTEMS; NLD; DA. 1979; VOL. 11; NO 2-3; PP. 201-215; BIBL. 13 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

  • Page / 34