Representation theorems on regular languagesHASHIGUCHI, K.Journal of computer and system sciences (Print). 1983, Vol 27, Num 1, pp 101-115, issn 0022-0000Article

On some variants of Post's correspondence problemRUOHONEN, K.Acta informatica. 1983, Vol 19, Num 4, pp 357-367, issn 0001-5903Article

The role of formalism in methodJACKSON, M.Lecture notes in computer science. 1999, issn 0302-9743, isbn 3-540-66587-0, 2Vol, p. 56Conference Paper

Integration, the price of success : Extended abstractSIFAKIS, J.Lecture notes in computer science. 1999, pp 52-55, issn 0302-9743, isbn 3-540-66587-0, 2VolConference Paper

Generosity : No Doubt, but at Times Excessive and DelusiveHOYRUP, Jens.Journal of Indian philosophy. 2007, Vol 35, Num 5-6, pp 469-485, issn 0022-1791, 17 p.Article

Adherences of D0L languagesHEAD, T.Theoretical computer science. 1984, Vol 31, Num 1-2, pp 139-149, issn 0304-3975Article

On the index of positive programmed formal languagesGUOZHU DONG.Information processing letters. 1995, Vol 54, Num 2, pp 105-110, issn 0020-0190Article

On the ratio of growth functions in EDTOL languagesEISMAN, G. S; SALOMAA, A.Theoretical computer science. 1984, Vol 29, Num 3, pp 325-349, issn 0304-3975Article

Stability in L systemsGREFENSTETTE, J. J.Theoretical computer science. 1984, Vol 28, Num 3, issn 0304-3975, 347Article

An Interpretation of Negation in Feature Structure DescriptionsDAWAR, A.Computational Linguistics. 1990, Vol 16, Num 1, pp 11-21, issn 0362-613XArticle

Inverse morphic equivalence on languagesKARHUMAKI, J; WOOD, D.Information processing letters. 1984, Vol 19, Num 5, pp 213-218, issn 0020-0190Article

Measure on P : Strength of the notionSTRAUSS, M.Information and computation (Print). 1997, Vol 136, Num 1, pp 1-23, issn 0890-5401Article

On regularity of languages generated by copying systemsEHRENFEUCHT, A; ROZENBERG, G.Discrete applied mathematics. 1984, Vol 8, Num 3, pp 313-317, issn 0166-218XArticle

On simulation on propagating EOL formsROZENBERG, G; VERRAEDT, R.Theoretical computer science. 1984, Vol 29, Num 1-2, pp 41-48, issn 0304-3975Article

On ω-languages whose syntactic monoid is trivialJURGENSEN, H; THIERRIN, G.International journal of computer & information sciences. 1983, Vol 12, Num 5, pp 359-365, issn 0091-7036Article

A negative result on inductive inference of extended pattern languagesREIDENBACH, Daniel.Lecture notes in computer science. 2002, pp 308-320, issn 0302-9743, isbn 3-540-00170-0, 13 p.Conference Paper

The structure of invertible substitutions on a three-letter alphabetBO TAN; WEN, Zhi-Xiong; YIPING ZHANG et al.Advances in applied mathematics (Print). 2004, Vol 32, Num 4, pp 736-753, issn 0196-8858, 18 p.Article

Automates et systèmes de numérationRIGO, Michel.Bulletin de la Société Royale des Sciences de Liège. 2004, Vol 73, Num 5-6, pp 257-270, issn 0037-9565, 14 p.Article

Splicing representations of strictly locally testable languagesHEAD, T.Discrete applied mathematics. 1998, Vol 87, Num 1-3, pp 139-147, issn 0166-218XArticle

Elementary formal systems, intrinsic complexity, and procrastinationJAIN, S; SHARMA, A.Information and computation (Print). 1997, Vol 132, Num 1, pp 65-84, issn 0890-5401Article

Inferring uniquely terminating regular languages from positive dataMÄKINEN, E.Information processing letters. 1997, Vol 62, Num 2, pp 57-60, issn 0020-0190Article

Recognizable subsets of the two letter plactic monoidARNOLD, A; KANTA, M; KROB, D et al.Information processing letters. 1997, Vol 64, Num 2, pp 53-59, issn 0020-0190Article

Solving trace equations using lexicographical normal formsDIEKERT, V; MATIYASEVICH, Y; MUSCHOLL, A et al.Lecture notes in computer science. 1997, pp 336-346, issn 0302-9743, isbn 3-540-63165-8Conference Paper

Approximately satisfied properties of systems and simple language homomorphismsNITSCHE, U; OCHSENSCHLGER, P.Information processing letters. 1996, Vol 60, Num 4, pp 201-206, issn 0020-0190Article

Page / 111