Pascal and Francis Bibliographic Databases

Help

Search results

Your search

cc.\*:("001D02A")

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

Origin

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

Results 1 to 25 of 64360

  • Page / 2575

Export

Selection :

  • and

An integrated framework for the diagnosis and correction of rule-based programsALPUENTE, M; BALLIS, D; CORREA, F et al.Theoretical computer science. 2010, Vol 411, Num 47, pp 4055-4101, issn 0304-3975, 47 p.Article

A syntactic correspondence between context-sensitive calculi and abstract machinesBIEMACKA, Malgorzata; DANVY, Olivier.Theoretical computer science. 2007, Vol 375, Num 1-3, pp 76-108, issn 0304-3975, 33 p.Article

Formalising Java RMI with explicit code mobilityAHEM, Alexander; YOSHIDA, Nobuko.Theoretical computer science. 2007, Vol 389, Num 3, pp 341-410, issn 0304-3975, 70 p.Article

Programmed grammars and their relation to the LBA problemBORDIHN, Henning; HOLZER, Markus.Acta informatica. 2006, Vol 43, Num 4, pp 223-242, issn 0001-5903, 20 p.Article

Automata, languages and programming (Crete, 8-12 July 2001)Orejas, Fernando; Spirakis, Paul G; van Leeuwen, Jan et al.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42287-0, XIV, 1083 p, isbn 3-540-42287-0Conference Proceedings

Pseudo-minimal transducerMAUREL, D.Theoretical computer science. 2000, Vol 231, Num 1, pp 129-139, issn 0304-3975Conference Paper

The HOM Problem Is DecidableGODOY, Guillem; GIMENEZ, Omer.Journal of the Association for Computing Machinery. 2013, Vol 60, Num 4, issn 0004-5411, 23.1-23.44Article

Hybrid dynamics of stochastic programsBORTOLUSSI, Luca; POLICRITI, Alberto.Theoretical computer science. 2010, Vol 411, Num 20, pp 2052-2077, issn 0304-3975, 26 p.Article

Well-founded semantics for Boolean grammarsKOUNTOURIOTIS, Vassilis; NOMIKOS, Christos; RONDOGIANNIS, Panos et al.Information and computation (Print). 2009, Vol 207, Num 9, pp 945-967, issn 0890-5401, 23 p.Article

A polynomial nominal unification algorithmCALVES, Christophe; FERNANDEZ, Maribel.Theoretical computer science. 2008, Vol 403, Num 2-3, pp 285-306, issn 0304-3975, 22 p.Article

Complexity theory for splicing systemsLOOS, Remco; OGIHARA, Mitsunori.Theoretical computer science. 2007, Vol 386, Num 1-2, pp 132-150, issn 0304-3975, 19 p.Article

Problems and exercises in discrete mathematicsGavrilov, G. P; Sapozhenko, A. A.Kluwer texts in the mathematical sciences. 1996, issn 0927-4529, isbn 0-7923-4036-1, XI, 422 p, isbn 0-7923-4036-1Book

A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systemsDUNLAING, Colm O; SCHLUTER, Natalie.Theoretical computer science. 2010, Vol 411, Num 3, pp 677-690, issn 0304-3975, 14 p.Article

A pseudo-random network mobile automaton with linear growthBOLOGNESI, Tommaso.Information processing letters. 2009, Vol 109, Num 13, pp 668-674, issn 0020-0190, 7 p.Article

The optimal read-once branching program complexity for the direct storage access functionBOLLIG, Beate.Information processing letters. 2008, Vol 106, Num 4, pp 171-174, issn 0020-0190, 4 p.Article

Semantic essence of AsmLGUREVICH, Yuri; ROSSMAN, Benjamin; SCHULTE, Wolfram et al.Theoretical computer science. 2005, Vol 343, Num 3, pp 370-412, issn 0304-3975, 43 p.Conference Paper

INTEX : an FST toolboxSILBERZTEIN, M.Theoretical computer science. 2000, Vol 231, Num 1, pp 33-46, issn 0304-3975Conference Paper

ICALP'97DEGANO, Pierpaolo; GORRIERI, Roberto; MARCHETTI-SPACCAMELA, Alberto et al.Theoretical computer science. 1999, Vol 221, Num 1-2, issn 0304-3975, 499 p.Conference Proceedings

An effective axiomatization for real time ACPFOKKINK, W; KLUSENER, S.Information and computation (Print). 1995, Vol 122, Num 2, pp 286-299, issn 0890-5401Article

Adaptive star grammars and their languagesDREWES, Frank; HOFFMANN, Berthold; JANSSENS, Dirk et al.Theoretical computer science. 2010, Vol 411, Num 34-36, pp 3090-3109, issn 0304-3975, 20 p.Article

Interference automataPANDURANGA RAO, M. V.Theoretical computer science. 2008, Vol 403, Num 1, pp 89-103, issn 0304-3975, 15 p.Article

Setting port numbers for fast graph explorationILCINKAS, David.Theoretical computer science. 2008, Vol 401, Num 1-3, pp 236-242, issn 0304-3975, 7 p.Article

Unfolding semantics of graph transformationBALDAN, Paolo; CORRADINI, Andrea; MONTANARI, Ugo et al.Information and computation (Print). 2007, Vol 205, Num 5, pp 733-782, issn 0890-5401, 50 p.Article

Operational semantics for Petri net componentsGROOTE, Jan Friso; VOORHOEVE, Marc.Theoretical computer science. 2007, Vol 379, Num 1-2, pp 1-19, issn 0304-3975, 19 p.Article

A compact fixpoint semantics for term rewriting systemsALPUENTE, M; COMINI, M; ESCOBAR, S et al.Theoretical computer science. 2010, Vol 411, Num 37, pp 3348-3371, issn 0304-3975, 24 p.Article

  • Page / 2575