Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("SENIZERGUES G")

Publication Year[py]

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

Discipline (document) [di]

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

Results 1 to 15 of 15

  • Page / 1
Export

Selection :

  • and

On the rational subsets of the free groupSENIZERGUES, G.Acta informatica. 1996, Vol 33, Num 3, pp 281-296, issn 0001-5903Article

The equivalence and inclusion problems for NTS languagesSENIZERGUES, G.Journal of computer and system sciences (Print). 1985, Vol 31, Num 3, pp 303-331, issn 0022-0000Article

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

Some decision problems about controlled rewritting systemsSENIZERGUES, G.Theoretical computer science. 1990, Vol 71, Num 3, pp 281-346, issn 0304-3975, 66 p.Article

A characterisation of deterministic context-free languages by means of right-congruencesSENIZERGUES, G.Theoretical computer science. 1990, Vol 70, Num 2, pp 213-232, issn 0304-3975Article

Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languagesSENIZERGUES, G.Information and computation (Print). 1989, Vol 81, Num 3, pp 265-279, issn 0890-5401Article

NTS language are deterministic and congruentialBOASSON, L; SENIZERGUES, G.Journal of computer and system sciences (Print). 1985, Vol 31, Num 3, pp 332-342, issn 0022-0000Article

Some undecidable termination problems for semi-Thue systemsSENIZERGUES, G.Theoretical computer science. 1995, Vol 142, Num 2, pp 257-276, issn 0304-3975Conference Paper

Complete formal systems for equivalence problemsSENIZERGUES, G.Theoretical computer science. 2000, Vol 231, Num 2, pp 309-334, issn 0304-3975Article

The equivalence problem for deterministic pushdown transducers into abelian groupsSENIZERGUES, G.Lecture notes in computer science. 1998, pp 305-315, issn 0302-9743, isbn 3-540-64827-5Conference Paper

Groups and NTS languagesAUTEBERT, J.-M; BOASSON, L; SENIZERGUES, G et al.Journal of computer and system sciences (Print). 1987, Vol 35, Num 2, pp 243-267, issn 0022-0000Article

Langages de parenthèses, langages N.T.S. et homomorphismes inverses = Parenthesis languages, NTS languages and inverse homomorphismsAUTEBERT, J.-M; BOASSON, L; SENIZERGUES, G et al.R.A.I.R.O. Informatique théorique. 1984, Vol 18, Num 4, pp 327-344, issn 0399-0540Article

The equivalence problem for deterministic pushdown automata is decidableSENIZERGUES, G.Lecture notes in computer science. 1997, pp 671-681, issn 0302-9743, isbn 3-540-63165-8Conference Paper

Remarques sur les langages de parenthèses = Remarks on the nest setsAUTEBERT, J. M; BEAUQUIER, J; BOASSON, L et al.Theoretical computer science. 1984, Vol 31, Num 3, pp 337-349, issn 0304-3975Article

T(A) = T(B)?SENIZERGUES, G.Lecture notes in computer science. 1999, pp 665-675, issn 0302-9743, isbn 3-540-66224-3Conference Paper

  • Page / 1