Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("EQUIVALENCE LANGAGE")

Publication Year[py]

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

Discipline (document) [di]

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

Author Country

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

Results 1 to 8 of 8

  • Page / 1
Export

Selection :

  • and

A NEW CLASS OF C.F.L. FOR WHICH THE EQUIVALENCE IS DECIDABLESENIZERGUES G.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 1; PP. 30-34; BIBL. 8 REF.Article

VERSCHRAENKTE HOMOMORPHISMEN FORMALER SPRACHEN = HOMOMORPHISMES CROISES DE LANGAGES FORMELSHOTZ G.1980; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1980; VOL. 14; NO 2; PP. 193-208; ABS. FRE/ENG; BIBL. 8 REF.Article

ON THE DECIDABILITY OF THE OL-DOL EQUIVALENCE PROBLEMRUOHONEN K.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 40; NO 3; PP. 301-318; BIBL. 17 REF.Article

Bounds for the D0L language equivalence problemHONKALA, Juha.Information and computation (Print). 2004, Vol 190, Num 1, pp 70-80, issn 0890-5401, 11 p.Article

The language equivalence problem for HDOL systems having DOL growthsHONKALA, Juha.Theoretical computer science. 2005, Vol 330, Num 1, pp 123-133, issn 0304-3975, 11 p.Article

ON THE DECIDABILITY OF HOMOMORPHISM EQUIVALENCE FOR LANGUAGESCULIK K II; SALOMAA A.1978; J. COMPUTER SYST. SCI.; USA; DA. 1978; VOL. 17; NO 2; PP. 163-175; BIBL. 5 REF.Article

Prime normal form and equivalence of simple grammarsBASTIEN, Cédric; CZYZOWICZ, Jurek; FRACZAK, Wojciech et al.Theoretical computer science. 2006, Vol 363, Num 2, pp 124-134, issn 0304-3975, 11 p.Article

Decidability of DPDA equivalenceSTIRLING, Colin.Theoretical computer science. 2001, Vol 255, Num 1-2, pp 1-31, issn 0304-3975Article

  • Page / 1