Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Automate")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

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

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 44555

  • Page / 1783
Export

Selection :

  • and

VARIOUS KINDS OF AUTOMATA WITH WEIGHTS.MIZUMOTO M; TOYODA J; TANAKA K et al.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 10; NO 2; PP. 219-236; BIBL. 21 REF.Article

ZUM BEGRIFF DES LINEAREN ND-AUTOMATEN. = SUR LA NOTION D'AUTOMATES LINEAIRES NON DETERMINISTESJUNG U.1975; ELEKTRON. INFORM.-VERARBEIT KYBERN.; DTSCH.; DA. 1975; VOL. 11; NO 10-12; PP. 576; (INT. SYMP. DISKRETE MATH. ANWEND. MATH. KYBERN.; BERLIN; 1974). RESUME.Conference Paper

AKZEPTIERBARKEITSGRADE REGULAERER FOLGENMENGEN. = DEGRE D'ACCEPTABILITE DES ENSEMBLES DE SUITES REGULIERESWAGNER K.1975; ELECTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1975; VOL. 11; NO 10-12; PP. 626-630; BIBL. 3 REF.; (INT. SYMP. DISHRETE MATH. ANWEND. MATH. KYBERN.; BERLIN; 1974). RESUME.Conference Paper

ZUR THEORIE LINEARER AUTOMATEN. = SUR LA THEORIE DES AUTOMATES LINEAIRESSTREICH WJ.1975; ELEKTRON. INFORM.-VERARBEIT KYBERN.; DTSCH.; DA. 1975; VOL. 11; NO 10-12; PP. 575; (INT. SYMP. DISKRETE MATH. ANWEND. MATH. KYBERN.; BERLIN; 1974). RESUMEConference Paper

On the construction of reversible automata for reversible languagesLOMBARDY, Sylvain.Lecture notes in computer science. 2002, pp 170-182, issn 0302-9743, isbn 3-540-43864-5, 13 p.Conference Paper

Two-way automata with more than one storage mediumVOGEL, J; WAGNER, K.Theoretical computer science. 1985, Vol 39, Num 2-3, pp 267-280, issn 0304-3975Article

Sequential machine characterizations of trellis and cellular automata and applicationsIBARRA, O.-H; KIM, S. M; MORAN, S et al.SIAM journal on computing (Print). 1985, Vol 14, Num 2, pp 426-447, issn 0097-5397Article

Note on the succinctness of deterministic, nondeterministic, probabilistic and quantum finite automataMEREGHETTI, Carlo; PALANO, Beatrice; PIGHIZZINI, Giovanni et al.Theoretical informatics and applications. 2001, Vol 35, Num 5, pp 477-490Article

The syntactic prediction with token automata : application to HandiAS systemMAUREL, Denis; LE PEVEDIC, Brigitte.Theoretical computer science. 2001, Vol 267, Num 1-2, pp 121-129, issn 0304-3975Article

On the class of languages recognizable by 1-way quantum finite automataAMBAINIS, Andris; KIKUSTS, Arnolds; VALDATS, Maris et al.Lecture notes in computer science. 2001, pp 75-86, issn 0302-9743, isbn 3-540-41695-1Conference Paper

Absorbing and ergodic discretized two-action learning automataOOMMEN, B. J.IEEE transactions on systems, man, and cybernetics. 1986, Vol 16, Num 2, pp 282-293, issn 0018-9472Article

LOWER BOUNDS ON THE SIZE OF SWEEPING AUTOMATASIPSER M.1980; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1980; VOL. 21; NO 2; PP. 195-202; BIBL. 8 REF.Article

Determinization of Büchi-automataROGGENBACH, Markus.Lecture notes in computer science. 2002, pp 43-60, issn 0302-9743, isbn 3-540-00388-6, 18 p.Conference Paper

SOME RESULTS CONCERNING AUTOMATA ON TWO-DIMENSIONAL TAPES.IBARRA OH; MELSON RT.1974; INTERNATION. J. COMPUTER MATH.; U.S.A.; DA. 1974; VOL. 4; NO 3; PP. 269-279; BIBL. 6 REF.Article

AUTOMATEN UEBER INPUTKATEGORIEN. = AUTOMATES SUR CATEGORIES D'ENTREEWECHLER W.1975; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1975; VOL. 11; NO 10-12; PP. 681-685; ABS. ANGL. RUSSE; BIBL. 13 REF.; (INT. SYMP. DISKRETE MATH. ANWEND. MATH. KYBERN.; BERLIN; 1974)Conference Paper

ZUSTANDSIDENTIFIZIERUNG AN ASYNCHRONEN AUTOMATEN. = IDENTIFICATION DE L'ETAT D'UN AUTOMATE ASYNCHRONEBURKHARD HD.1975; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1975; VOL. 11; NO 10-12; PP. 653-658; BIBL. 6 REF.; (INT. SYMP. DISKRETE MATH. ANWEND. MATH. KYBERN.; BERLIN; 1974). RESUMEConference Paper

THE EQUIVALENCE PROBLEM FOR DETERMINISTIC FINITE-TURN PUSHDOWN AUTOMATA.VALIANT LG.1974; INFORM. AND CONTROL; U.S.A.; DA. 1974; VOL. 25; NO 2; PP. 123-133; BIBL. 6 REF.Article

NOMBRE DE TOURS DE LA TETE A PILE D'UN AUTOMATE MP A DEUX VOIES AVEC MEMOIREBARASHKO AS.1974; KIBERNETICA, U.S.S.R.; S.S.S.R.; DA. 1974; NO 4; PP. 9-14; ABS. ANGL.; BIBL. 6 REF.Article

ZUR ANALYSE UND SYNTHESE ASYNCHRONER STOCHASTISCHER AUTOMATEN. = ANALYSE ET SYNTHESE D'AUTOMATES ASYNCHRONES STOCHASTIQUESRICHARDT J.1974; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1974; VOL. 10; NO 2-3; PP. 123-132; ABS. ANGL. RUSSE; BIBL. 3 REF.Article

SUR UNE METHODE DE CONCEPTION LOGIQUE D'UN BLOC DE COMMANDEKAPITONOVA YU V; MISHCHENKO AT.1972; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1972; NO 3; PP. 4-12; ABS. ANGL.; BIBL. 20 REF.Serial Issue

A SHORT PROOF ON THE CYCLIC BEHAVIOUR OF MULTITHRESHOLD SYMMETRIC AUTOMATAGOLES CE; MARTINEZ AS.1981; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1981; VOL. 51; NO 2; PP. 95-97; BIBL. 3 REF.Article

REGIMES POTENTIELS ET REELS DE FONCTIONNEMENT DES AUTOMATES FINIS ASYNCHRONESLEVIN VI.1976; TEOR. KOMECH. AVTOMATOV PRILOZH., LATIV. S.S.R.; S.S.S.R.; DA. 1976; NO 6; PP. 9-19; BIBL. 5 REF.Article

ON CAUSAL OMEGA 2-SYSTEMS.NAKAMURA A.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 10; NO 2; PP. 253-265; BIBL. 3 REF.Article

TWO-WAY NESTED STACK AUTOMATA ARE EQUIVALENT TO TWO-WAY STACK AUTOMATA.BEERI C.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 10; NO 3; PP. 317-339; BIBL. 9 REF.Article

STABILITE DES AUTOMATES PROBABILISTES FINISLORENTS AA.1974; TEOR. KONECH. AVTOMATOV PRILOZH., LATV. S.S.R.; S.S.S.R.; DA. 1974; NO 3; PP. 52-60; BIBL. 10 REF.Article

  • Page / 1783