Pascal and Francis Bibliographic Databases

Help

Search results

Your search

ti.\*:("Developments in language theory (10th international conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006)")

Document Type [dt]

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

Discipline (document) [di]

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 41

  • Page / 2
Export

Selection :

  • and

Developments in language theory (10th international conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006)Ibarra, Oscar H; Dang, Zhe.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-35428-X, 1Vol, XII-456 p, isbn 3-540-35428-XConference Proceedings

Closure of language classes under bounded duplicationITO, Masami; LEUPOLD, Peter; SHIKISHIMA-TSUJI, Kayoko et al.Lecture notes in computer science. 2006, pp 238-247, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 10 p.Conference Paper

Languages in membrane computing : Some details for spiking neural P systemsPAUN, Gheorghe.Lecture notes in computer science. 2006, pp 20-35, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 16 p.Conference Paper

Can abstract state machines Be useful in language theory? : (Extended abstract)GUREVICH, Yuri; WALLACE, Charles.Lecture notes in computer science. 2006, pp 14-19, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 6 p.Conference Paper

A decision procedure for reflexive regular splicing languagesBONIZZONI, Paola; MAURI, Giancarlo.Lecture notes in computer science. 2006, pp 315-326, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 12 p.Conference Paper

Context-dependent nondeterminism for pushdown automataKUTRIB, Martin; MALCHER, Andreas.Lecture notes in computer science. 2006, pp 133-144, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 12 p.Conference Paper

Equivalence of functions represented by simple context-free grammars with outputBASTIEN, Cédric; CZYZOWICZ, Jurek; FRACZAK, Wojciech et al.Lecture notes in computer science. 2006, pp 71-82, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 12 p.Conference Paper

Finding lower bounds for nondeterministic state complexity is hard : (Extended abstract)GRUBER, Hermann; HOLZER, Markus.Lecture notes in computer science. 2006, pp 363-374, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 12 p.Conference Paper

Noncanonical LALR(1) parsingSCHMITZ, Sylvain.Lecture notes in computer science. 2006, pp 95-107, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 13 p.Conference Paper

Perfect correspondences between dot-depth and polynomial-time hierarchyGLABER, Christian; TRAVERS, Stephen; WAGNER, Klaus W et al.Lecture notes in computer science. 2006, pp 408-419, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 12 p.Conference Paper

Polynomials, fragments of temporal logic and the variety DA over tracesKUFLEITNER, Manfred.Lecture notes in computer science. 2006, pp 37-48, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 12 p.Conference Paper

Synchronizing automata with a letter of deficiency 2ANANICHEV, D. S; VOLKOV, M. V; ZAKS, Yu. I et al.Lecture notes in computer science. 2006, pp 433-442, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 10 p.Conference Paper

Well-founded semantics for boolean grammarsKOUNTOURIOTIS, Vassilis; NOMIKOS, Christos; RONDOGIANNIS, Panos et al.Lecture notes in computer science. 2006, pp 203-214, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 12 p.Conference Paper

Context-free grammars and XML languagesBERTONI, Alberto; CHOFFRUT, Christian; PALANO, Beatrice et al.Lecture notes in computer science. 2006, pp 108-119, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 12 p.Conference Paper

End-marked maximal depth-first contextual grammarsLAKSHMANAN, K.Lecture notes in computer science. 2006, pp 339-350, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 12 p.Conference Paper

Language equations with complementationOKHOTIN, Alexander; YAKIMOVA, Oksana.Lecture notes in computer science. 2006, pp 420-432, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 13 p.Conference Paper

Lowering undecidability bounds for decision questions in matricesBELL, Paul; POTAPOV, Igor.Lecture notes in computer science. 2006, pp 375-385, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 11 p.Conference Paper

On weakly ambiguous finite transducersSANTEAN, Nicolae; SHENG YU.Lecture notes in computer science. 2006, pp 156-167, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 12 p.Conference Paper

Prime decompositions of regular languagesHAN, Yo-Sub; SALOMAA, Kai; WOOD, Derick et al.Lecture notes in computer science. 2006, pp 145-155, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 11 p.Conference Paper

Simulation relations for alternating parity automata and parity gamesFRITZ, Carsten; WILKE, Thomas.Lecture notes in computer science. 2006, pp 59-70, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 12 p.Conference Paper

The boolean closure of growing context-sensitive languagesJURDZINSKI, Tomasz.Lecture notes in computer science. 2006, pp 248-259, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 12 p.Conference Paper

Computational nature of biochemical reactionsEHRENFEUCHT, A; ROZENBERG, G.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-35428-X, 1Vol, p.36Conference Paper

Contextual hypergraph grammars - : A new approach to the generation of hypergraph languagesDEDIU, Adrian-Horia; KLEMPIEN-HINRICHS, Renate; KREOWSKI, Hans-Jörg et al.Lecture notes in computer science. 2006, pp 327-338, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 12 p.Conference Paper

On some variations of two-way probabilistic finite automata modelsRAVIKUMAR, Bala.Lecture notes in computer science. 2006, pp 443-454, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 12 p.Conference Paper

Synchronization of pushdown automataCAUCAL, Didier.Lecture notes in computer science. 2006, pp 120-132, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 13 p.Conference Paper

  • Page / 2