Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("FINITE 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 2430

  • Page / 98

Export

Selection :

  • and

LIMITEDNESS THEOREM ON FINITE AUTOMATA WITH DISTANCE FUNCTIONSHASHIGUCHI K.1982; JOURNAL OF COMPUTER AND SYSTEM SCIENCES; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 2; PP. 233-244; BIBL. 7 REF.Article

A FINITE 5-PEBBLE-AUTOMATON CAN SEARCH EVERY MAZESZEPIETOWSKI A.1982; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1982; VOL. 15; NO 5; PP. 199-204; BIBL. 3 REF.Article

AUTOMATA AND LABYRINTHSBUDACH L.1978; MATH. NACHR.; DDR; DA. 1978; VOL. 86; PP. 195-282; BIBL. 14 REF.Article

ON CHARACTERISTIC SETS AND DEGREES OF FINITE AUTOMATA.TANATSUGU K; ARIKAWA S.1977; INTERNATION. J. COMPUTER INFORM. SCI.; U.S.A.; DA. 1977; VOL. 6; NO 1; PP. 83-93; BIBL. 1 REF.Article

SUR LES MOTS SYNCHRONISANTS DANS UN AUTOMATE FINIPIN JE.1978; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DDR; DA. 1978; VOL. 14; NO 6; PP. 297-303; ABS. ENG/GER/RUSArticle

ENUMERATION DES AUTOMATES FINISKORSHUNOV AD.1978; PROBL. KIBERN.; SUN; DA. 1978; NO 34; PP. 5-82; BIBL. 46 REF.Article

ON PEBBLE DOES NOT SUFFICE TO SEARCH PLANE LABYRINTHSHOFFMANN F.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 433-444; BIBL. 11 REF.Conference Paper

FIXED BLOTS IN TOLERANCE AUTOMATAWARNER MW.1980; KYBERNETES; GBR; DA. 1980; VOL. 9; NO 3; PP. 193-195; BIBL. 7 REF.Article

A NOTE ON SWEEPING AUTOMATABERMAN P.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 91-97; BIBL. 3 REF.Conference Paper

AN ISOMORPHISM OF COMPLETE DEGREES OF FINITE-STATE TRANSFORMABILITYGORDON HG.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 40; NO 2; PP. 192-204; BIBL. 9 REF.Article

COMPLEXITY OF AUTOMATON IDENTIFICATION FROM GIVEN DATA.GOLD EM.1978; INFORM. AND CONTROL; USA; DA. 1978; VOL. 37; NO 3; PP. 302-320; BIBL. 9 REF.Article

A REALIZATION ALGORITHM FOR MULTIPLE PRESET EXPERIMENTS.FRALEY D; TALAVAGE J.1976; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1976; VOL. 25; NO 11; PP. 1130-1132; BIBL. 7 REF.Article

ONE-WAY SIMPLE MULTIHEAD FINITE AUTOMATAINOUE K; TAKANAMI I; NAKAMURA A et al.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 9; NO 3; PP. 311-328; BIBL. 19 REF.Article

PROPERTIES OF FINITE AND PUSHDOWN TRANSDUCERSCHOFFRUT C; CULIK K II.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 2; PP. 300-315; BIBL. 21 REF.Article

SUR LES ALGORITHMES DE REALISATION DES AUTOMATES FINIS DANS LES STRUCTURES DE CALCULS HOMOGENES A CELLULES DEFECTUEUSESASATIANI GG; CHACHANIDZE VG.1983; AVTOMATIKA I TELEMEHANIKA; ISSN 0005-2310; SUN; DA. 1983; NO 1; PP. 160-169; ABS. ENG; BIBL. 9 REF.Article

EFFICIENT TABLE-DRIVEN IMPLEMENTATION OF THE FINITE STATE MACHINEHARRISON PG.1982; JOURNAL OF SYSTEMS AND SOFTWARE; ISSN 0164-1212; USA; DA. 1982; VOL. 2; NO 3; PP. 201-211; BIBL. 8 REF.Article

GENERALIZED IDENTIFICATION EXPERIMENTS FOR FINITE DETERMINISTIC AUTOMATABURKHARD HD.1982; BANACH CENT. PUBL.; ISSN 0137-6934; POL; DA. 1982; VOL. 7; PP. 45-51; BIBL. 6 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

THE EQUIVALENCE PROBLEM FOR DETERMINISTIC TWO WAY PROBLEM SEQUENTIAL TRANSDUCERS IS DECIDABLEGURARI EM.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 3; PP. 448-452; BIBL. 9 REF.Article

DERIVATIVES OF TREE SETS WITH APPLICATIONS TO GRAMMATICAL INFERENCELEVINE B.1981; IEEE TRANS. PATTERN ANAL. MACH. INTELL.; ISSN 0162-8828; USA; DA. 1981; VOL. 3; NO 3; PP. 284-293; BIBL. 18 REF.Article

PROPRIETES DE CLOTURE D'UNE EXTENSION DE TRANSDUCTEURS D'ARBRES DETERMINISTESLILIN E.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 112; PP. 280-289; ABS. ENG; BIBL. 8 REF.Conference Paper

SYNTHESE DES AUTOMATES SYNCHRONES A AUTOCONTROLE D'APRES L'ETAT DE SORTIELOPUKHA AL; SAPOZHNIKOV VV; SAPOZHNIKOV VV et al.SAPOZHNIKOV VV; SAPOZHNIKOV VV et al.1981; IZV. AKAD. NAUK SSSR, TEH. KIBERN.; ISSN 0002-3388; SUN; DA. 1981; NO 1; PP. 144-149; BIBL. 4 REF.Article

A NECESSARY AND SUFFICIENT CONDITION FOR FUNDAMENTAL PERIODS OF CASCADE MACHINES TO BE PRODUCTS OF THE FUNDAMENTAL PERIODS OF THEIR CONSTITUENT FINITE STATE MACHINESBLAKLEY GR; PURDY GB.1981; INF. SCI. (N. YORK); ISSN 0020-0255; USA; DA. 1981; VOL. 24; NO 1; PP. 71-91; BIBL. 9 REF.Article

AN INCOMPLETENESS THEOREM FOR ONE-DIMENSIONAL BINARY CELLULAR ACCEPTORSMORIYA T.1981; INFORM. CONTROL; ISSN 0019-9958; USA; DA. 1981; VOL. 50; NO 3; PP. 185-198; BIBL. 6 REF.Article

ANOTHER HIERARCHY DEFINED BY MULTIHEAD FINITE AUTOMATAJANIGA L.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 314-320; BIBL. 6 REF.Conference Paper

  • Page / 98