Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("AUTOMATE A PILE")

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 492

  • Page / 20

Export

Selection :

  • and

THE EQUIVALENCE OF STACK-COUNTER ACCEPTORS AND QUASI-REAL TIME STACK-COUNTER ACCEPTORS. = EQUIVALENCE ENTRE LES ACCEPTEURS ANTI-PILES ET DES ACCEPTEURS ANTI-PILES EN TEMPS QUASI-REELGINSBURG S; ROSE GF.1974; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1974; VOL. 8; NO 2; PP. 243-269; BIBL. 11 REF.Article

ON CO-SETS ASSOCIATED WITH CONTEXT-FREE LANGUAGES.LINNA M.1976; INFORM. AND CONTROL; U.S.A.; DA. 1976; VOL. 31; NO 3; PP. 272-293; BIBL. 11 REF.Article

ON OMEGA -WORDS AND OMEGA -COMPUTATIONS.LINNA M.1975; ANN. UNIV. TURKU., A1; FINL.; DA. 1975; NO 168; PP. 1-53; BIBL. 1 P.; ISBN 9516412580Serial Issue

THE DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC STATELESS PUSHDOWN AUTOMATAOYAMAGUCHI M; HONDA N.1978; INFORM. AND CONTROL; USA; DA. 1978; VOL. 38; NO 3; PP. 367-376; BIBL. 9 REF.Article

A NOTE ON NON-SINGULAR DETERMINISTIC PUSHDOWN AUTOMATAFRIEDMAN EP.1978; THEOR. COMPUTER SCI.; NLD; DA. 1978; VOL. 7; NO 3; PP. 333-339; BIBL. 3 REF.Article

A USEFUL DEVICE FOR SHOWING THE SOLVABILITY OF SOME DECISION PROBLEMS.IBARRA OH; KIM CE.1976; J. COMPUTER SYST.; U.S.A.; DA. 1976; VOL. 13; NO 2; PP. 153-160; BIBL. 12 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

CONTROL OF PUSHDOWN AUTOMATA.YAMASAKI S; KAMBAYASHI Y.1974; SYST. COMPUTERS CONTROLS; U.S.A.; DA. 1974; VOL. 5; NO 5; PP. 36-42; BIBL. 5 REF.Article

RECONNAISSANCE DE SOUS ARBORESCENCESCHAUCHE J.1972; REV. FR. INFORMAT. RECH. OPERAT., R; FR.; DA. 1972; VOL. 5; NO 3; PP. 89-95; BIBL. 6 REF.Serial Issue

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

REGULARITY AND RELATED PROBLEMS FOR DETERMINISTIC PUSHDOWN AUTOMATO.VALIANT LG.1975; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1975; VOL. 22; NO 1; PP. 1-10; BIBL. 13 REF.Article

DESCRIPTION OF RESTRICTED AUTOMATA BY FIRST-ORDER FORMULAE.LEWIS HR.1975; MATH. SYST. THEORY; U.S.A.; DA. 1975; VOL. 9; NO 2; PP. 97-104; BIBL. 12 REF.Article

ON THE DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC PUSHDOWN AUTOMATA.TANIGUCHI K; KASAMI T; SUGIYAMA Y et al.1975; SYST. COMPUTERS CONTROLS; U.S.A.; DA. 1975; VOL. 6; NO 1; PP. 36-44; BIBL. 10 REF.Article

AN EFFECTIVE SIMULATION OF DETERMINISTIC PUSHDOWN AUTOMATA WITH MANY TWO-WAY AND ONE-WAY HEADSRYTTER W.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 5; PP. 234-236; BIBL. 3 REF.Article

A CLASS OF BINARY RATE ONE-HALF CONVOLUTIONAL CODES THAT ALLOWS AN IMPROVED STACK DECODERVINCK AJ; DE PAEPE AJP; ASCHALKWIJK JPM et al.1980; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1980; VOL. 26; NO 4; PP. 389-392; BIBL. 8 REF.Article

A TURING MACHINE SPACE HIERARCHYZAK S.1979; KYBERNETIKA; CSK; DA. 1979; VOL. 15; NO 2; PP. 100-121; BIBL. 9 REF.Article

ON SALOMAA'S ABSTRACT PUSHDOWN AUTOMATA.HUZINO S.1978; MEM. FAC. SCI. KYUSHU UNIV., A; JPN; DA. 1978; VOL. 32; NO 1; PP. 67-71; BIBL. 4 REF.Article

REVERSAL-BOUNDED MULTICOUNTER MACHINES AND THEIR DECISION PROBLEMS.IBARRA OH.1978; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1978; VOL. 25; NO 1; PP. 116-133; BIBL. 27 REF.Article

ON JUMP-DETERMINISTIC PUSDOWN AUTOMATACOURCELLE B.1977; MATH. SYST. THEORY; USA; DA. 1977; VOL. 11; NO 2; PP. 87-109; BIBL. 26 REF.Article

AN IMPROVEMENT ON VALIANT'S DECISION PROCEDURE FOR EQUIVALENCE OF DETERMINISTIC FINITE-TURN PUSHDOWN AUTOMATA.BEERI C.1975; IN: ANNU. SYMP. FOUND. COMPUT. SCI. 16; BERKELEY, CALIF.; 1975; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1975; PP. 128-134; BIBL. 6 REF.Conference Paper

ON THE PARSING OF DETERMINISTIC LANGUAGES.HARRISON MA; HAVEL IM.1974; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1974; VOL. 21; NO 4; PP. 525-548; BIBL. 26 REF.Article

RECURSIVE SCHEMES ALGEBRAIC TREES AND DETERMINISTIC LANGUAGES.COURCELLE B.1974; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1974; NO 78; PP. 1-11; ABS. FR.; BIBL. 12 REF.Article

THE EQUIVALENCE PROBLEM FOR SOME NON-REAL-TIME DETERMINISTIC PUSHDOWN AUTOMATAUKKONEN E.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 4; PP. 1166-1181; BIBL. 17 REF.Article

THE DYNAMIC SIMULATION OF RECURSIVE AND STACK MANIPULATING PROGRAMSRYTTER W.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 2; PP. 58-63; BIBL. 8 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

  • Page / 20