default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs25.bht:"
@article{DBLP:journals/tcs/CaseS83, author = {John Case and Carl Smith}, title = {Comparison of Identification Criteria for Machine Inductive Inference}, journal = {Theor. Comput. Sci.}, volume = {25}, pages = {193--220}, year = {1983}, url = {https://doi.org/10.1016/0304-3975(83)90061-0}, doi = {10.1016/0304-3975(83)90061-0}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CaseS83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Courcelle83, author = {Bruno Courcelle}, title = {Fundamental Properties of Infinite Trees}, journal = {Theor. Comput. Sci.}, volume = {25}, pages = {95--169}, year = {1983}, url = {https://doi.org/10.1016/0304-3975(83)90059-2}, doi = {10.1016/0304-3975(83)90059-2}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Courcelle83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Kfoury83, author = {A. J. Kfoury}, title = {Definability by Programs in First-Order Structures}, journal = {Theor. Comput. Sci.}, volume = {25}, pages = {1--66}, year = {1983}, url = {https://doi.org/10.1016/0304-3975(83)90013-0}, doi = {10.1016/0304-3975(83)90013-0}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Kfoury83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Milner83, author = {Robin Milner}, title = {Calculi for Synchrony and Asynchrony}, journal = {Theor. Comput. Sci.}, volume = {25}, pages = {267--310}, year = {1983}, url = {https://doi.org/10.1016/0304-3975(83)90114-7}, doi = {10.1016/0304-3975(83)90114-7}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Milner83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Nelson83, author = {Evelyn Nelson}, title = {Iterative Algebras}, journal = {Theor. Comput. Sci.}, volume = {25}, pages = {67--94}, year = {1983}, url = {https://doi.org/10.1016/0304-3975(83)90014-2}, doi = {10.1016/0304-3975(83)90014-2}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Nelson83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ODunlaing83, author = {Colm {\'{O}}'D{\'{u}}nlaing}, title = {Infinite Regular Thue Systems}, journal = {Theor. Comput. Sci.}, volume = {25}, pages = {171--192}, year = {1983}, url = {https://doi.org/10.1016/0304-3975(83)90060-9}, doi = {10.1016/0304-3975(83)90060-9}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ODunlaing83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Priese83, author = {Lutz Priese}, title = {Automata and Concurrency}, journal = {Theor. Comput. Sci.}, volume = {25}, pages = {221--265}, year = {1983}, url = {https://doi.org/10.1016/0304-3975(83)90113-5}, doi = {10.1016/0304-3975(83)90113-5}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Priese83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Valk83, author = {R{\"{u}}diger Valk}, title = {Infinite Behaviour of Petri Nets}, journal = {Theor. Comput. Sci.}, volume = {25}, pages = {311--341}, year = {1983}, url = {https://doi.org/10.1016/0304-3975(83)90115-9}, doi = {10.1016/0304-3975(83)90115-9}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Valk83.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.