Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs126.bht:"
@article{DBLP:journals/tcs/AlurD94, author = {Rajeev Alur and David L. Dill}, title = {A Theory of Timed Automata}, journal = {Theor. Comput. Sci.}, volume = {126}, number = {2}, pages = {183--235}, year = {1994}, url = {https://doi.org/10.1016/0304-3975(94)90010-8}, doi = {10.1016/0304-3975(94)90010-8}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/AlurD94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Andersen94, author = {Henrik Reif Andersen}, title = {Model Checking and Boolean Graphs}, journal = {Theor. Comput. Sci.}, volume = {126}, number = {1}, pages = {3--30}, year = {1994}, url = {https://doi.org/10.1016/0304-3975(94)90266-6}, doi = {10.1016/0304-3975(94)90266-6}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Andersen94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CaronC94, author = {Anne{-}C{\'{e}}cile Caron and Jean{-}Luc Coquid{\'{e}}}, title = {Decidability of Reachability for Disjoint Union of Term Rewriting Systems}, journal = {Theor. Comput. Sci.}, volume = {126}, number = {1}, pages = {31--52}, year = {1994}, url = {https://doi.org/10.1016/0304-3975(94)90267-4}, doi = {10.1016/0304-3975(94)90267-4}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/CaronC94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Courcelle94, author = {Bruno Courcelle}, title = {Monadic Second-Order Definable Graph Transductions: {A} Survey}, journal = {Theor. Comput. Sci.}, volume = {126}, number = {1}, pages = {53--75}, year = {1994}, url = {https://doi.org/10.1016/0304-3975(94)90268-2}, doi = {10.1016/0304-3975(94)90268-2}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Courcelle94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Dam94, author = {Mads Dam}, title = {CTL* and ECTL* as Fragments of the Modal mu-Calculus}, journal = {Theor. Comput. Sci.}, volume = {126}, number = {1}, pages = {77--96}, year = {1994}, url = {https://doi.org/10.1016/0304-3975(94)90269-0}, doi = {10.1016/0304-3975(94)90269-0}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Dam94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GerhardP94, author = {J. A. Gerhard and Mario Petrich}, title = {Unification in Free Distributive Lattices}, journal = {Theor. Comput. Sci.}, volume = {126}, number = {2}, pages = {237--257}, year = {1994}, url = {https://doi.org/10.1016/0304-3975(94)90011-6}, doi = {10.1016/0304-3975(94)90011-6}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GerhardP94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Oostrom94, author = {Vincent van Oostrom}, title = {Confluence by Decreasing Diagrams}, journal = {Theor. Comput. Sci.}, volume = {126}, number = {2}, pages = {259--280}, year = {1994}, url = {https://doi.org/10.1016/0304-3975(92)00023-K}, doi = {10.1016/0304-3975(92)00023-K}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Oostrom94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/PeledP94, author = {Doron A. Peled and Amir Pnueli}, title = {Proving Partial Order Properties}, journal = {Theor. Comput. Sci.}, volume = {126}, number = {2}, pages = {143--182}, year = {1994}, url = {https://doi.org/10.1016/0304-3975(94)90009-4}, doi = {10.1016/0304-3975(94)90009-4}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/PeledP94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Potthoff94, author = {Andreas Potthoff}, title = {Modulo-Counting Quantifiers Over Finite Trees}, journal = {Theor. Comput. Sci.}, volume = {126}, number = {1}, pages = {97--112}, year = {1994}, url = {https://doi.org/10.1016/0304-3975(94)90270-4}, doi = {10.1016/0304-3975(94)90270-4}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Potthoff94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Regnier94, author = {Laurent Regnier}, title = {Une {\'{e}}quivalence sur les lambda-termes}, journal = {Theor. Comput. Sci.}, volume = {126}, number = {2}, pages = {281--292}, year = {1994}, url = {https://doi.org/10.1016/0304-3975(94)90012-4}, doi = {10.1016/0304-3975(94)90012-4}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Regnier94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Seidl94, author = {Helmut Seidl}, title = {Finite Tree Automata with Cost Functions}, journal = {Theor. Comput. Sci.}, volume = {126}, number = {1}, pages = {113--142}, year = {1994}, url = {https://doi.org/10.1016/0304-3975(94)90271-2}, doi = {10.1016/0304-3975(94)90271-2}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Seidl94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.