DEVELOPMENTAL SYSTEMS WITH INTERACTION AND FRAGMENTATION.RUOHONEN K.1975; INFORM. AND CONTROL.; U.S.A.; DA. 1975; VOL. 28; NO 2; PP. 91-112; BIBL. 5 REF.Article

SOME PROPERTIES OF THE CLASS OF L LANGUAGES WITH INTERACTIONS.ROZENBERG G; LEE KP.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 11; NO 1; PP. 129-147; BIBL. 10 REF.Article

TWO NON-CLOSURE RESULTS ON FAMILIES OF L LANGUAGES.KL NONOVE T.1978; B.I.T.; DANM.; DA. 1978; VOL. 18; NO 1; PP. 109-111; BIBL. 6 REF.Article

A SEMANTIC BASIS FOR PROGRAM VERIFICATION. = BASE SEMANTIQUE POUR LA VERIFICATION DE PROGRAMMESHATCHER WS.1974; J. CYBERN.; U.S.A.; DA. 1974; VOL. 4; NO 1; PP. 61-69; BIBL. 5 REF.Article

A SEQUENT CALCULUS FOR KROEGER LOGICSZABO ME.1983; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1983; VOL. 148; PP. 295-303; BIBL. 9 REF.Conference Paper

ETOL-GRAMMARS AND N-GRAMMARS.PENTTONEN M.1975; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1975; VOL. 4; NO 1; PP. 11-13; BIBL. 13 REF.Article

A CHARACTERIZATION OF A DOT-DEPTH TWO ANALOGUE OF GENERALIZED DEFINITE LANGUAGESFICH FE; BRZOZOWSKI JA.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 230-244; BIBL. 23 REF.Conference Paper

The Ehrenfeucht conjecture: a compactness claim for finitely generated free monoidsKARHUMAKI, J; SALOMAA, A.Theoretical computer science. 1984, Vol 29, Num 3, pp 285-308, issn 0304-3975Article

Context-free complexity of finite languagesBUCHER, W; MAURER, H. A; CULIK, K. II et al.Theoretical computer science. 1984, Vol 28, Num 3, pp 277-285, issn 0304-3975Article

Deterministic dynamic logic is strictly weaker than dynamic logicSTOLBOUSHKIN, A. P; TAITSLIN, M. A.Information and control. 1983, Vol 57, Num 1, pp 48-55, issn 0019-9958Article

Une application de la représentation matricielle des transductions = An application to matrix representation of transductionsPIN, J. E; SAKAROVITCH, J.Theoretical computer science. 1985, Vol 35, Num 2-3, pp 271-293, issn 0304-3975Article

THREE RESULTS OF COMPARISON BETWEEN L LANGUAGES WITH AND WITHOUT INTERACTION.RUOHONEN K.1975; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1975; VOL. 4; NO 1; PP. 7-10; BIBL. 3 REF.Article

SZILARD LANGUAGES OF 10-GRAMMARSDUSKE J; PARCHMANN; SPECHT J et al.1979; INFORM. AND CONTROL.; USA; DA. 1979; VOL. 40; NO 3; PP. 319-331; BIBL. 5 REF.Article

Prefix-primitive annihilators of languages under some operationsFAN, Chen-Ming; HUANG, Cheng-Chih; CHRISTINE CHIFEN TSENG et al.Acta informatica. 2012, Vol 49, Num 5, pp 281-293, issn 0001-5903, 13 p.Article

LIMIT BEHAVIOR OF LOCALLY CONSISTENT CONSTRAINT SATISFACTION PROBLEMSBODIRSKY, Manuel; KRAL, Daniel.SIAM journal on discrete mathematics (Print). 2011, Vol 25, Num 1-2, pp 916-933, issn 0895-4801, 18 p.Article

String distances and intrusion detection : Bridging the gap between formal languages and computer securityBRUSCHI, Danilo; PIGHIZZINI, Giovanni.Informatique théorique et applications (Imprimé). 2006, Vol 40, Num 2, pp 303-313, issn 0988-3754, 11 p.Article

ON LOG-TAPE ISOMORPHISMS OF COMPLETE SETSHARTMANIS J.1978; THEOR. COMPUTER SCI.; NLD; DA. 1978; VOL. 7; NO 3; PP. 273-286; BIBL. 9 REF.Article

Canonical scattered context generators of sentences with their parsesMEDUNA, Alexander; TECHET, Jiri.Theoretical computer science. 2007, Vol 389, Num 1-2, pp 73-81, issn 0304-3975, 9 p.Article

A note on algebras of languagesMARINI, Claudio; SIMI, Giulia; SORBI, Andrea et al.Theoretical computer science. 2011, Vol 412, Num 46, pp 6531-6536, issn 0304-3975, 6 p.Article

Efficient inclusion checking for deterministic tree automata and XML schemasCHAMPAVERE, Jérôme; GILLERON, Rémi; LEMAY, Aurélien et al.Information and computation (Print). 2009, Vol 207, Num 11, pp 1181-1208, issn 0890-5401, 28 p.Conference Paper

On the structure of the counting function of sparse context-free languagesD'ALESSANDRO, Flavio; INTFIGILA, Benedetto; VARRICCHIO, Stefano et al.Theoretical computer science. 2006, Vol 356, Num 1-2, pp 104-117, issn 0304-3975, 14 p.Article

Complementing unary nondeterministic automataMERA, Filippo; PIGHIZZINI, Giovanni.Theoretical computer science. 2005, Vol 330, Num 2, pp 349-360, issn 0304-3975, 12 p.Conference Paper

Uncountable automatic classes and learningJAIN, Sanjay; QINGLONG LUO; SEMUKHIN, Pavel et al.Theoretical computer science. 2011, Vol 412, Num 19, pp 1805-1820, issn 0304-3975, 16 p.Article

Efficient enumeration of words in regular languagesACKERMAN, Margareta; SHALLIT, Jeffrey.Theoretical computer science. 2009, Vol 410, Num 37, pp 3461-3470, issn 0304-3975, 10 p.Article

Detecting palindromes, patterns and borders in regular languagesANDERSON, Terry; LOFTUS, John; RAMPERSAD, Narad et al.Information and computation (Print). 2009, Vol 207, Num 11, pp 1096-1118, issn 0890-5401, 23 p.Conference Paper