Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("ACCEPTOR 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 93

  • Page / 4
Export

Selection :

  • and

L-FUZZY FUNCTORIAL AUTOMATATRNKOVA V.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 463-473; BIBL. 12 REF.Conference Paper

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

SYSTOLIC TREES AND SYSTOLIC LANGUAGE RECOGNITION BY TREE AUTOMATASTEINBY M.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 22; NO 1; PP. 219-232; BIBL. 13 REF.Article

A NOTE ON REBOUND AUTOMATAINOUE K; TAKANAMI I; TANIGUCHI H et al.1982; INF. SCI. (N. YORK); ISSN 0020-0255; USA; DA. 1982; VOL. 26; NO 1; PP. 87-93; BIBL. 4 REF.Article

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

LOG DIAMETER RESTRICTED BOTTOM-UP TRIANGLE CELLULAR ACCEPTORSKLETTE R.1980; INF. SCI. (N. YORK); ISSN 0020-0255; USA; DA. 1980; VOL. 22; NO 1; PP. 37-43; BIBL. 2 REF.Article

ONE-WAY WEAK-STACK-COUNTER AUTOMATAMIYANO S.1980; J. COMPUTER SYST. SCI.; USA; DA. 1980; VOL. 20; NO 1; PP. 59-76; BIBL. 13 REF.Article

CLOSURE PROPERTIES OF THE CLASSES OF SETS ACCEPTED BY AUTOMATA ON A TWO-DIMENSIONAL TAPE UNDER TWO OPERATIONSINOUE K; TAKANAMI I.1978; SYST., COMPUT., CONTROLS; ISSN 0096-8765; USA; DA. 1978 PUBL. 1980; VOL. 9; NO 6; PP. 10-17; BIBL. 11 REF.Article

A NOTE ON A FAMILY OF ACCEPTORS FOR SOME FAMILIES OF DEVELOPMENTAL LANGUAGES.ROZENBERG G; WOOD D.1976; INTERNATION. J. COMPUTER MATH.; U.S.A.; DA. 1976; VOL. 5; NO 4; PP. 261-266; BIBL. 6 REF.Article

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

DETERMINANCY OF SINKING AUTOMATA ON INFINITE TREES AND INEQUALITIES BETWEEN VARIOUS RABIN'S PAIR INDICESMOSTOWSKI AW.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 15; NO 4; PP. 159-163; BIBL. 7 REF.Article

PARALLEL RANDOM ACCESS MACHINES WITH POWERFUL INSTRUCTION SETSSAVITCH W.1982; MATH. SYST. THEORY; ISSN 0025-5661; DEU; DA. 1982; VOL. 15; NO 3; PP. 191-210; BIBL. 14 REF.Article

A REMARK ON TWO-DIMENSIONAL FINITE AUTOMATANAKAMURA A; INOUE K.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 10; NO 4-5; PP. 219-222; BIBL. 4 REF.Article

LINEAR REGULAR SETSMAXSON CJ.1978; ACTA INFORMAT.; DEU; DA. 1978; VOL. 10; NO 2; PP. 203-208; BIBL. 3 REF.Article

SYSTOLIC AUTOMATA FOR VLSI ON BALANCED TREESCULIK K II; GRUSKA J; SALOMAA A et al.1983; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1983; VOL. 18; NO 4; PP. 335-344; BIBL. 4 REF.Article

A NOTE ON W-REGULAR LANGUAGESTAKAHASHI M; YAMASAKI H.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 23; NO 2; PP. 217-225; BIBL. 6 REF.Article

MULTIHEAD FINITE STATE AUTOMATA AND CONCATENATIONDURIS P; HROMKOVIC J.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 176-186; BIBL. 11 REF.Conference Paper

AN EXTENDED RESULT ON THE EQUIVALENCE PROBLEM FOR LR MACHINES TAKING MONOTONOUS EPSILON -MOVESSEKIMOTO S.1981; SYSTEMS, COMPUTERS, CONTROLS; ISSN 0096-8765; USA; DA. 1981-1982; VOL. 12; NO 3; PP. 30-37; BIBL. 9 REF.Article

PARALLEL SIGMA -ERASING ASSAY ACCEPTORSNAKAMURA A.1980; COMPUT. GRAPH. IMAGE PROCESS.; ISSN 0146-664X; USA; DA. 1980; VOL. 14; NO 1; PP. 80-86; BIBL. 4 REF.Article

THREE-WAY TWO-DIMENSIONAL MULTICOUNTER AUTOMATESINOUE K; TAKANAMI I.1979; INFORM. SCI.; USA; DA. 1979; VOL. 19; NO 1; PP. 1-20; BIBL. 9 REF.Article

AN ACCEPTOR FOR ALGEBRAIC POWER SERIESWECHLER W.1979; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DDR; DA. 1979; VOL. 15; NO 12; PP. 611-619; ABS. GER/RUS; BIBL. 4 REF.Article

AN ALGORITHM FOR CONSTRUCTING A SIMPLE ACCEPTOR OF LINE-SEGMENTSOKAZAKI A; YOSHIDA Y; FUKUMURA T et al.1979; TRANS. INST. ELECTRON. COMMUN. ENG. JPN., E; JPN; DA. 1979; VOL. 62; NO 9; PP. 599-600; BIBL. 1 REF.Article

LOGICAL COMPLEXITY OF SOME CLASSES OF TREE LANGUAGES GENERATED BY MULTIPLE-TREE-AUTOMATABUSKOWSKI W.1980; Z. MATH. LOGIK GRUNDL. MATH.; DDR; DA. 1980; VOL. 26; NO 1; PP. 41-49; BIBL. 5 REF.Article

SEQUENTIAL AND CELLULAR GRAPH AUTOMATAWU A; ROSENFELD A.1980; INFORM. SCI.; USA; DA. 1980; VOL. 20; NO 1; PP. 57-68; BIBL. 20 REF.Article

TWO-DIMENSIONAL AUTOMATA WITH ROTATED INPUTSINOUE K; TAKANAMI I; TANIGUCHI H et al.1980; INF. SCI. (N. YORK); ISSN 0020-0255; USA; DA. 1980; VOL. 21; NO 3; PP. 221-240; BIBL. 9 REF.Article

  • Page / 4