Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Formal language")

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

Results 1 to 25 of 2578

  • Page / 104
Export

Selection :

  • and

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

Init and Anf operating on ω-languagesFREUND, R.Information processing letters. 1983, Vol 16, Num 5, pp 265-269, issn 0020-0190Article

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

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

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

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

A hierarchy of shift equivalent sofic shiftsBEAL, Marie-Pierre; FIORENZI, Francesca; PERRIN, Dominique et al.Theoretical computer science. 2005, Vol 345, Num 2-3, pp 190-205, issn 0304-3975, 16 p.Conference Paper

Accepting splicing systemsMITRANA, Victor; PETRE, Ion; ROGOJIN, Vladimir et al.Theoretical computer science. 2010, Vol 411, Num 25, pp 2414-2422, issn 0304-3975, 9 p.Article

The relations among Watson-Crick automata and their relations with context-free languagesOKAWA, Satoshi; HIROSE, Sadaki.IEICE transactions on information and systems. 2006, Vol 89, Num 10, pp 2591-2599, issn 0916-8532, 9 p.Article

The state complexity of L2 and LkRAMPERSAD, Narad.Information processing letters. 2006, Vol 98, Num 6, pp 231-234, issn 0020-0190, 4 p.Article

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

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

Parallel detection of all palindromes in a stringAPOSTOLICO, A; BRESLAUER, D; ZVI GALIL et al.Theoretical computer science. 1995, Vol 141, Num 1-2, pp 163-173, issn 0304-3975Article

Code properties and homomorphisms of DOL systemsHEAD, T; WILKINSON, J.Theoretical computer science. 1985, Vol 35, Num 2-3, pp 295-312, issn 0304-3975Article

Complexity results on the conjugacy problem for monoidsNARENDRAN, P; OTTO, F.Theoretical computer science. 1985, Vol 35, Num 2-3, pp 227-243, issn 0304-3975Article

  • Page / 104