Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("BOOK RV")

Results 1 to 25 of 32

  • Page / 2
Export

Selection :

  • and

BOUNDED QUERY MACHINES: ON NP AND PSPACEBOOK RV.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 5; NO 1; PP. 27-39; BIBL. 17 REF.Article

THE POWER OF THE CHURCH-ROSSER PROPERTY FOR STRING REWRITING SYSTEMSBOOK RV.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 138; PP. 360-368; BIBL. 20 REF.Conference Paper

ON THE COMPLEXITY OF FORMAL GRAMMARS.BOOK RV.1978; ACTA INFORMAT.; ALLEM.; DA. 1978; VOL. 9; NO 2; PP. 171-181; BIBL. 20 REF.Article

ON LANGUAGES WITH A CERTAIN PREFIX PROPERTY.BOOK RV.1976; MATH. SYST. THEORY; U.S.A.; DA. 1976-1977; VOL. 10; NO 3; PP. 229-237; BIBL. 16 REF.Article

CONFLUENT AND OTHER TYPES OF THUE SYSTEMSBOOK RV.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 1; PP. 171-182; BIBL. 19 REF.Article

WHEN IS A MONOID A GROUP. THE CHURCH-ROSSER CASE IS TRACTABLEBOOK RV.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 18; NO 3; PP. 325-331; BIBL. 15 REF.Article

NTS GRAMMARS AND CHURCH-ROSSER SYSTEMSBOOK RV.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 2; PP. 73-76; BIBL. 11 REF.Article

THE UNDECIDABILITY OF A WORD PROBLEM: ON A CONJECTURE OF STRONG MAGGIOLO-SCHETTINI AND ROSENBOOK RV.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 3; PP. 121-122; BIBL. 3 REF.Article

A NOTE ON SPECIAL THUE SYSTEMS WITH A SINGLE DEFINING RELATIONBOOK RV.1983; MATHEMATICAL SYSTEMS THEORY; ISSN 0025-5661; DEU; DA. 1983; VOL. 16; NO 1; PP. 57-60; BIBL. 14 REF.Article

ON LANGUAGES ACCEPTED BY SPACE-BOUNDED ORACLE MACHINESBOOK RV.1979; ACTA INFORMAT.; DEU; DA. 1979; VOL. 12; NO 2; PP. 177-185; BIBL. 13 REF.Article

POLYNOMIAL SPACE AND TRANSITIVE CLOSUREBOOK RV.1979; S.I.A.M.J. COMPUTG; USA; DA. 1979; VOL. 8; NO 3; PP. 434-439; BIBL. 9 REF.Article

ON FORMAL GRAMMARS (PRELIMINARY REPORT)BOOK RV.1978; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS. 12/1978-03-29/BALTIMORE; USA; BALTIMORE: JOHNS HOPKINS UNIVERSITY; DA. 1978; PP. 336-339; BIBL. 23 REF.Conference Paper

TRANSLATIONAL LEMMAS, POLYNOMIAL TIME AND (LOG N)3-SPACE.BOOK RV.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 1; NO 3; PP. 215-226; BIBL. 14 REF.Article

COMPLEXITY CLASSES OF FORMAL LANGUAGES (PRELIMINARY REPORT)BOOK RV.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 43-56; BIBL. 24 REF.Conference Paper

A REMARK ON TALLY LANGUAGES AND COMPLEXITY CLASSESBOOK RV.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 43; NO 2; PP. 198-201; BIBL. 6 REF.Article

SIMPLE REPRESENTATIONS OF CERTAIN CLASSES OF LANGUAGES.BOOK RV.1978; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1978; VOL. 25; NO 1; PP. 23-31; BIBL. 19 REF.Article

TESTING FOR THE CHURCH-ROSSER PROPERTYBOOK RV; O'DUNLAING CP.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 16; NO 2; PP. 223-229; BIBL. 12 REF.Article

EQUALITY SETS AND COMPLEXITY CLASSESBOOK RV; BRANDENBURG FJ.1980; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1980; VOL. 9; NO 4; PP. 729-743; BIBL. 14 REF.Article

ON THE USE OF LINEAR LANGUAGES IN FORMAL LANGUAGE THEORY.BOOK RV; NIVAT M.sdIN: CONF. INF. SCI. SYST. PROC.; BALTIMORE; 1977; BALTIMORE; JOHNS HOPKINS UNIV.; DA. S.D.; PP. 190-194; BIBL. 14 REF.Conference Paper

MUTUALLY DIVISIBLE SEMIGROUPS.BOOK RV; HARRISON MA.1974; DISCRETE MATH.; NETHERL.; DA. 1974; VOL. 9; NO 4; PP. 329-332; BIBL. 6 REF.Article

REPRESENTING COMPLEXITY CLASSES BY EQUALITY SETSBOOK RV; BRANDENBURG FJ.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 49-57; BIBL. 10 REF.Conference Paper

A NOTE ON COMPLETE SETS AND TRANSITIVE CLOSUREBOOK RV; WRATHALL C.1982; MATHEMATICAL SYSTEMS THEORY; ISSN 0025-5661; DEU; DA. 1982; VOL. 15; NO 4; PP. 311-313; BIBL. 7 REF.Article

THE INDEPENDENCE OF CERTAIN OPERATIONS ON SEMI AFLSBOOK RV; GREIBACH SA.1978; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1978; VOL. 12; NO 4; PP. 369-385; BIBL. 31 REF.Article

REVERSAL-BOUNDED MULTIPUSHDOWN MACHINES.BAKER BS; BOOK RV.1974; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1974; VOL. 8; NO 3; PP. 315-332; BIBL. 19 REF.; (13TH ANNU. IEEE SYMP. SWITCHING AUTOM. THEORY; COLLEGE PARK, MD.; 1972)Conference Paper

ON LANGUAGES SPECIFIED BY RELATIVE ACCEPTANCEBOOK RV; WRATHALL C.1978; THEOR. COMPUTER SCI.; NLD; DA. 1978; VOL. 7; NO 2; PP. 185-195; BIBL. 25 REF.Article

  • Page / 2