default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs18.bht:"
@article{DBLP:journals/tcs/BerstelR82, author = {Jean Berstel and Christophe Reutenauer}, title = {Recognizable Formal Power Series on Trees}, journal = {Theor. Comput. Sci.}, volume = {18}, pages = {115--148}, year = {1982}, url = {https://doi.org/10.1016/0304-3975(82)90019-6}, doi = {10.1016/0304-3975(82)90019-6}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BerstelR82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Best82, author = {Eike Best}, title = {Adequacy Properties of Path Programs}, journal = {Theor. Comput. Sci.}, volume = {18}, pages = {149--171}, year = {1982}, url = {https://doi.org/10.1016/0304-3975(82)90020-2}, doi = {10.1016/0304-3975(82)90020-2}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Best82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Book82, author = {Ronald V. Book}, title = {When is a Monoid a Group? The Church-Rosser Case is Tractable}, journal = {Theor. Comput. Sci.}, volume = {18}, pages = {325--331}, year = {1982}, url = {https://doi.org/10.1016/0304-3975(82)90072-X}, doi = {10.1016/0304-3975(82)90072-X}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Book82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Boussinot82, author = {Fr{\'{e}}d{\'{e}}ric Boussinot}, title = {Proposition de Semantique Denotationelle pour des Reseaux de Processus avec Operateur de Melange Equitable}, journal = {Theor. Comput. Sci.}, volume = {18}, pages = {173--206}, year = {1982}, url = {https://doi.org/10.1016/0304-3975(82)90021-4}, doi = {10.1016/0304-3975(82)90021-4}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Boussinot82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Crochemore82, author = {Maxime Crochemore}, title = {Sharp Characterizations of Squarefree Morphisms}, journal = {Theor. Comput. Sci.}, volume = {18}, pages = {221--226}, year = {1982}, url = {https://doi.org/10.1016/0304-3975(82)90023-8}, doi = {10.1016/0304-3975(82)90023-8}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Crochemore82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CulikH82, author = {Karel Cul{\'{\i}}k II and Tero Harju}, title = {Dominoes Over a Free Monoid}, journal = {Theor. Comput. Sci.}, volume = {18}, pages = {279--300}, year = {1982}, url = {https://doi.org/10.1016/0304-3975(82)90070-6}, doi = {10.1016/0304-3975(82)90070-6}, timestamp = {Wed, 24 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CulikH82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Ershov82, author = {Andrei P. Ershov}, title = {Mixed Computation: Potential Applications and Problems for Study}, journal = {Theor. Comput. Sci.}, volume = {18}, pages = {41--67}, year = {1982}, url = {https://doi.org/10.1016/0304-3975(82)90111-6}, doi = {10.1016/0304-3975(82)90111-6}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Ershov82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Furer82, author = {Martin F{\"{u}}rer}, title = {The Complexity of Presburger Arithmetic with Bounded Quantifier Alternation Depth}, journal = {Theor. Comput. Sci.}, volume = {18}, pages = {105--111}, year = {1982}, url = {https://doi.org/10.1016/0304-3975(82)90115-3}, doi = {10.1016/0304-3975(82)90115-3}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Furer82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GoldstinePW82, author = {Jonathan Goldstine and John K. Price and Detlef Wotschke}, title = {A Pushdown Automaton or a Context-Free Grammar - Which is More Economical?}, journal = {Theor. Comput. Sci.}, volume = {18}, pages = {33--40}, year = {1982}, url = {https://doi.org/10.1016/0304-3975(82)90110-4}, doi = {10.1016/0304-3975(82)90110-4}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GoldstinePW82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Hagauer82, author = {Johann Hagauer}, title = {On Form-Equivalence of Deterministic pure Grammar Forms}, journal = {Theor. Comput. Sci.}, volume = {18}, pages = {69--87}, year = {1982}, url = {https://doi.org/10.1016/0304-3975(82)90112-8}, doi = {10.1016/0304-3975(82)90112-8}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Hagauer82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Istrail82, author = {Sorin Istrail}, title = {Generalization of the Ginsburg-Rice Sch{\"{u}}tzenberger Fixed-Point Theorem for Context-Sensitive and Recursive-Enumerable Languages}, journal = {Theor. Comput. Sci.}, volume = {18}, pages = {333--341}, year = {1982}, url = {https://doi.org/10.1016/0304-3975(82)90073-1}, doi = {10.1016/0304-3975(82)90073-1}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Istrail82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Leivant82, author = {Daniel Leivant}, title = {Unprovability of Theorems of Complexity Theory in Weak Number Theories}, journal = {Theor. Comput. Sci.}, volume = {18}, pages = {259--268}, year = {1982}, url = {https://doi.org/10.1016/0304-3975(82)90068-8}, doi = {10.1016/0304-3975(82)90068-8}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Leivant82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/MaruokaK82, author = {Akira Maruoka and Masayuki Kimura}, title = {Strong Surjectivity is Equivalent to C-Injectivity}, journal = {Theor. Comput. Sci.}, volume = {18}, pages = {269--277}, year = {1982}, url = {https://doi.org/10.1016/0304-3975(82)90069-X}, doi = {10.1016/0304-3975(82)90069-X}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/MaruokaK82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/MeyerW82, author = {Albert R. Meyer and Karl Winklmann}, title = {Expressing Program Looping in Regular Dynamic Logic}, journal = {Theor. Comput. Sci.}, volume = {18}, pages = {301--323}, year = {1982}, url = {https://doi.org/10.1016/0304-3975(82)90071-8}, doi = {10.1016/0304-3975(82)90071-8}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/MeyerW82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Pair82, author = {Claude Pair}, title = {Abstract Data Types and Algebraic Semantics of Programming Languages}, journal = {Theor. Comput. Sci.}, volume = {18}, pages = {1--31}, year = {1982}, url = {https://doi.org/10.1016/0304-3975(82)90109-8}, doi = {10.1016/0304-3975(82)90109-8}, timestamp = {Tue, 16 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/Pair82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Schnitger82, author = {Georg Schnitger}, title = {A Family of Graphs with Expensive Depth Reduction}, journal = {Theor. Comput. Sci.}, volume = {18}, pages = {89--93}, year = {1982}, url = {https://doi.org/10.1016/0304-3975(82)90113-X}, doi = {10.1016/0304-3975(82)90113-X}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Schnitger82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Schoning82, author = {Uwe Sch{\"{o}}ning}, title = {A Uniform Approach to Obtain Diagonal Sets in Complexity Classes}, journal = {Theor. Comput. Sci.}, volume = {18}, pages = {95--103}, year = {1982}, url = {https://doi.org/10.1016/0304-3975(82)90114-1}, doi = {10.1016/0304-3975(82)90114-1}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Schoning82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Sifakis82, author = {Joseph Sifakis}, title = {A Unified Approach for Studying the Properties of Transition Systems}, journal = {Theor. Comput. Sci.}, volume = {18}, pages = {227--258}, year = {1982}, url = {https://doi.org/10.1016/0304-3975(82)90067-6}, doi = {10.1016/0304-3975(82)90067-6}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Sifakis82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Uchimura82, author = {Keisuke Uchimura}, title = {Properties of Structure Generating Functions of Automata and their Applications for Linear Systems}, journal = {Theor. Comput. Sci.}, volume = {18}, pages = {207--220}, year = {1982}, url = {https://doi.org/10.1016/0304-3975(82)90022-6}, doi = {10.1016/0304-3975(82)90022-6}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Uchimura82.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.