Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("AUTOMATON COMPLEXITY")

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 266

  • Page / 11
Export

Selection :

  • and

TOWARD A MATHEMATICAL THEORY OF GRAPH-GENERATIVE SYSTEMS AND ITS APPLICATION.NG PA; BANG SY.1976; INFORM. SCI.; U.S.A.; DA. 1976; VOL. 11; NO 3; PP. 223-250; BIBL. 1 P.Article

CONCEPTION DES AUTOMATES REORGANISABLESPUPYREV EI.1981; AVTOM. TELEMEH.; ISSN 0005-2310; SUN; DA. 1981; NO 2; PP. 145-155; ABS. ENG; BIBL. 17 REF.Article

BESCHREIBUNG UND ENTSCHEIDBARKEIT. (BEITRAG ZUM BEGRIFF DER KOMPLEXITAET II). = CONCEPTION ET DECIDABILITE. CONTRIBUTION AU DOMAINE DE LA COMPLEXITE)KORNWACHS K; VON LUCADOU W.1976; GRUNDLAGENSTUD. KYBERN. U. GEISTESWISSENSCH.; DTSCH.; DA. 1976; VOL. 17; NO 3; PP. 79-86; BIBL. 7 REF.Article

RELATIONS BETWEEN DIAGONALIZATION, PROOF SYSTEMS, AND COMPLEXITY GAPSHARTMANIS J.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 8; NO 2; PP. 239-253; BIBL. 9 REF.Article

RELATING REFINED SPACE COMPLEXITY CLASSES.SEIFERAS JI.1977; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1977; VOL. 14; NO 1; PP. 100-129; BIBL. 1 P.Article

SOME TIME-SPACE TRADEOFF RESULTS CONCERNING SINGLE-TAPE AND OFFLINE TM'SIBARRA OH; MORAN S.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 2; PP. 388-394; BIBL. 6 REF.Article

RECURSIVE TURING MACHINES.SAVITCH WJ.1977; INTERNATION. J. COMPUTER MATH.; U.S.A.; DA. 1977; VOL. 6; NO 1; PP. 3-31; BIBL. 4 REF.Article

TECHNIQUES FOR SEPARATING SPACE COMPLEXITY CLASSES.SEIFERAS JI.1977; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1977; VOL. 14; NO 1; PP. 73-99; BIBL. 1 P. 1/2Article

ON THE MINIMAL COMPLEXITY OF COMPONENT-MACHINES FOR SELF-CORRECTING NETWORKS.PRIESE L.1976; J. CYBERN.; U.S.A.; DA. 1976; VOL. 5; NO 4; PP. 97-118; BIBL. 4 REF.Article

THE COMPLEXITY OF AUTOMATA AND SUBTHEORIES OF MONADIC SECOND ORDER ARITHMETICSMOSTOWSKI AW.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 453-466; BIBL. 19 REF.Conference Paper

THE EQUALITY PROBLEM FOR VECTOR ADDITION SYSTEMS IS UNDECIDABLE.HACK M.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 2; NO 1; PP. 77-95; BIBL. 15 REF.Article

ON REDUCING THE NUMBER OF STATES IN A PDAGOLDSTINE J; PRICE JK; WOTSCHKE D et al.1982; MATHEMATICAL SYSTEMS THEORY; ISSN 0025-5661; DEU; DA. 1982; VOL. 15; NO 4; PP. 315-321; BIBL. 10 REF.Article

CRITERES DE REPRESENTABILITE DES LANGAGES DANS LES AUTOMATES PROBABILISTESFAN DIN ZIEU.1977; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1977; NO 3; PP. 39-50; ABS. ANGL.; BIBL. 29 REF.Article

A CLASS OF INFINITE DIMENSIONAL LINEAR SYSTEMS.PARR FN.1976; MATH. SYST. THEORY; U.S.A.; DA. 1976; VOL. 10; NO 1; PP. 53-67; BIBL. 7 REF.Article

TIME HIERARCHIES OF RECURSIVE COMPUTATIONS.STIMSON MJ; SAVITCH WJ.sdIN: CONF. INF. SCI. SYST. PROC.; BALTIMORE; 1977; BALTIMORE; JOHNS HOPKINS UNIV.; DA. S.D.; PP. 6-7; BIBL. 3 REF.Conference Paper

ON THE FINITE-VALUEDNESS PROBLEM FOR SEQUENTIAL MACHINESTAT HUNG CHAN; IBARRA OH.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 23; NO 1; PP. 95-101; BIBL. 6 REF.Article

THE COMPLEXITY OF DECISION PROBLEMS FOR FINITE-TURN MULTICOUNTER MACHINESGURARI EM; IBARRA OH.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 495-505; BIBL. 18 REF.Conference Paper

COMPLEXITY MEASURES AND HIERARCHIES FOR THE EVALUATION OF INTEGERS AND POLYNOMIALS.LIPTON RJ; DOBKIN D.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976 PARU 1977; VOL. 3; NO 3; PP. 349-357; BIBL. 10 REF.Article

RELATIVIZATION OF QUESTIONS ABOUT LOG SPACE COMPUTABILITY.LADNER RE; LYNCH NA.1976; MATH. SYST. THEORY; U.S.A.; DA. 1976; VOL. 10; NO 1; PP. 19-32; BIBL. 22 REF.Article

RECOGNITION OF TOPOLOGICAL EQUIVALENCE OF PATTERNS BY ARRAY AUTOMATADIETZ P; RAO KOSARAJU S.1980; J. COMPUTER SYST. SCI.; USA; DA. 1980; VOL. 20; NO 1; PP. 111-116; BIBL. 4 REF.Article

COMPLEXITY-CLASS-ENCODING STATES.LYNCH N.1976; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1976; VOL. 13; NO 1; PP. 100-118; BIBL. 15 REF.Article

ALGORITHME EFFECTIF DE MINIMISATION DE LA COMPLEXITE DU SCHEMA DES AUTOMATES INCOMPLETEMENT DEFINIS, DONNES PAR DES GRAPHES NON RAMIFIESGRIGORYAN AK; SHIPILINA LB.1979; AVTOMAT. I TELEMEKH.; SUN; DA. 1979; NO 10; PP. 95-104; ABS. ENG; BIBL. 6 REF.Article

A RELATION BETWEEN SPACE, RETURN AND DUAL RETURN COMPLEXITIESWECHSUNG G; BRANDSTAEDT A.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 9; NO 1; PP. 127-140; BIBL. 9 REF.Article

ONE WAY FINITE VISIT AUTOMATA.GREIBACH SA.1978; THEOR. COMPUTER SCI.; NETHERL.; DA. 1978; VOL. 6; NO 2; PP. 175-221; BIBL. 1 P. 1/2Article

LANGUAGE RECOGNITION ABILITIES OF SEVERAL TWO-DIMENSIONAL TAPE AUTOMATA AND THEIR RELATION TO TAPE COMPLEXITIESMORITA K; UMEO H; SUGATA K et al.1977; SYST. COMPUTERS CONTROLS; USA; DA. 1977 PUBL. 1979; VOL. 8; NO 6; PP. 58-65Article

  • Page / 11