TCS / Research / Publications / Analyzing Context-Free Grammars Using an Incremental SAT Solver
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

Analyzing Context-Free Grammars Using an Incremental SAT Solver

Reference:

Roland Axelsson, Keijo Heljanko, and Martin Lange. Analyzing context-free grammars using an incremental SAT solver. In Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, and Igor Walukiewicz, editors, Proceedings of the 35th International Colloquium on Automata, Languages, and Programming (ICALP'08), Part II, volume 5126 of Lecture Notes in Computer Science, pages 410–422, Reykjavik, Iceland, July 2008. Springer-Verlag.

Suggested BibTeX entry:

@inproceedings{AxeHelLan:ICALP08,
    address = {Reykjavik, Iceland},
    author = {Roland Axelsson and Keijo Heljanko and Martin Lange},
    booktitle = {Proceedings of the 35th International Colloquium on Automata, Languages, and Programming (ICALP'08), Part II},
    editor = {Luca Aceto and Ivan Damg{\aa}rd and Leslie Ann Goldberg and Magn{\'u}s M. Halld{\'o}rsson and Anna Ing{\'o}lfsd{\'o}ttir and Igor Walukiewicz},
    month = {July},
    pages = {410--422},
    publisher = {Springer-Verlag},
    series = {Lecture Notes in Computer Science},
    title = {Analyzing Context-Free Grammars Using an Incremental {SAT} Solver},
    volume = {5126},
    year = {2008},
}

See www.tcs.hut.fi ...

[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links]
Latest update: 19 January 2010.