Search dblp for Publications

export results for "toc:db/journals/tcs/tcs48.bht:"

 download as .bib file

@article{DBLP:journals/tcs/BerryS86,
  author       = {G{\'{e}}rard Berry and
                  Ravi Sethi},
  title        = {From Regular Expressions to Deterministic Automata},
  journal      = {Theor. Comput. Sci.},
  volume       = {48},
  number       = {3},
  pages        = {117--126},
  year         = {1986},
  url          = {https://doi.org/10.1016/0304-3975(86)90088-5},
  doi          = {10.1016/0304-3975(86)90088-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BerryS86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BublitzSW86,
  author       = {Siegfried Bublitz and
                  Ute Sch{\"{u}}rfeld and
                  Ingo Wegener},
  title        = {Properties of Complexity Measures for Prams and Wrams},
  journal      = {Theor. Comput. Sci.},
  volume       = {48},
  number       = {3},
  pages        = {53--73},
  year         = {1986},
  url          = {https://doi.org/10.1016/0304-3975(86)90083-6},
  doi          = {10.1016/0304-3975(86)90083-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BublitzSW86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Chrobak86a,
  author       = {Marek Chrobak},
  title        = {Hierarchies of One-Way Multihead Automata Languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {48},
  number       = {3},
  pages        = {153--181},
  year         = {1986},
  url          = {https://doi.org/10.1016/0304-3975(86)90093-9},
  doi          = {10.1016/0304-3975(86)90093-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Chrobak86a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Danko86,
  author       = {Wiktor Danko},
  title        = {First-Order Approximation of Algorithmic Theories},
  journal      = {Theor. Comput. Sci.},
  volume       = {48},
  number       = {3},
  pages        = {257--272},
  year         = {1986},
  url          = {https://doi.org/10.1016/0304-3975(86)90097-6},
  doi          = {10.1016/0304-3975(86)90097-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Danko86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Duboc86a,
  author       = {Christine Duboc},
  title        = {Mixed Product and Asynchronous Automata},
  journal      = {Theor. Comput. Sci.},
  volume       = {48},
  number       = {3},
  pages        = {183--199},
  year         = {1986},
  url          = {https://doi.org/10.1016/0304-3975(86)90094-0},
  doi          = {10.1016/0304-3975(86)90094-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Duboc86a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/EhrenfeuchtHR86,
  author       = {Andrzej Ehrenfeucht and
                  Hendrik Jan Hoogeboom and
                  Grzegorz Rozenberg},
  title        = {On the Active and Full Use of Memory in Right-Boundary Grammars and
                  Push-Down Automata},
  journal      = {Theor. Comput. Sci.},
  volume       = {48},
  number       = {3},
  pages        = {201--228},
  year         = {1986},
  url          = {https://doi.org/10.1016/0304-3975(86)90095-2},
  doi          = {10.1016/0304-3975(86)90095-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/EhrenfeuchtHR86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/EngelfrietV86a,
  author       = {Joost Engelfriet and
                  Heiko Vogler},
  title        = {\emph{Corrigenda: } Pushdown Machines for the Macro Tree Tranducer},
  journal      = {Theor. Comput. Sci.},
  volume       = {48},
  number       = {3},
  pages        = {339},
  year         = {1986},
  url          = {https://doi.org/10.1016/0304-3975(86)90102-7},
  doi          = {10.1016/0304-3975(86)90102-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/EngelfrietV86a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/EsikG86,
  author       = {Zolt{\'{a}}n {\'{E}}sik and
                  Ferenc G{\'{e}}cseg},
  title        = {On alpha-0-Products and alpha-2-Products},
  journal      = {Theor. Comput. Sci.},
  volume       = {48},
  number       = {3},
  pages        = {1--8},
  year         = {1986},
  url          = {https://doi.org/10.1016/0304-3975(86)90080-0},
  doi          = {10.1016/0304-3975(86)90080-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/EsikG86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Fitting86,
  author       = {Melvin Fitting},
  title        = {Partial Models and Logic Programming},
  journal      = {Theor. Comput. Sci.},
  volume       = {48},
  number       = {3},
  pages        = {229--255},
  year         = {1986},
  url          = {https://doi.org/10.1016/0304-3975(86)90096-4},
  doi          = {10.1016/0304-3975(86)90096-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Fitting86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GibbonsR86,
  author       = {Alan Gibbons and
                  Wojciech Rytter},
  title        = {On the Decidability of Some Problems about Rational Subsets of Free
                  Partially Commutative Monoids},
  journal      = {Theor. Comput. Sci.},
  volume       = {48},
  number       = {3},
  pages        = {329--337},
  year         = {1986},
  url          = {https://doi.org/10.1016/0304-3975(86)90101-5},
  doi          = {10.1016/0304-3975(86)90101-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GibbonsR86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GinsburgT86,
  author       = {Seymour Ginsburg and
                  Chang{-}jie Tang},
  title        = {Projection of Object Histories},
  journal      = {Theor. Comput. Sci.},
  volume       = {48},
  number       = {3},
  pages        = {297--328},
  year         = {1986},
  url          = {https://doi.org/10.1016/0304-3975(86)90100-3},
  doi          = {10.1016/0304-3975(86)90100-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GinsburgT86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HeadL86a,
  author       = {Tom Head and
                  Barbara Lando},
  title        = {Regularity of Sets of Initial Strings of Periodic D0L-Systems},
  journal      = {Theor. Comput. Sci.},
  volume       = {48},
  number       = {3},
  pages        = {101--108},
  year         = {1986},
  url          = {https://doi.org/10.1016/0304-3975(86)90086-1},
  doi          = {10.1016/0304-3975(86)90086-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HeadL86a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Hromkovic86,
  author       = {Juraj Hromkovic},
  title        = {Communication Complexity Hierarchy},
  journal      = {Theor. Comput. Sci.},
  volume       = {48},
  number       = {3},
  pages        = {109--115},
  year         = {1986},
  url          = {https://doi.org/10.1016/0304-3975(86)90087-3},
  doi          = {10.1016/0304-3975(86)90087-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Hromkovic86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Italiano86,
  author       = {Giuseppe F. Italiano},
  title        = {Amortized Efficiency of a Path Retrieval Data Structure},
  journal      = {Theor. Comput. Sci.},
  volume       = {48},
  number       = {3},
  pages        = {273--281},
  year         = {1986},
  url          = {https://doi.org/10.1016/0304-3975(86)90098-8},
  doi          = {10.1016/0304-3975(86)90098-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Italiano86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Ko86a,
  author       = {Ker{-}I Ko},
  title        = {On the Notion of Infinite Pseudorandom Sequences},
  journal      = {Theor. Comput. Sci.},
  volume       = {48},
  number       = {3},
  pages        = {9--33},
  year         = {1986},
  url          = {https://doi.org/10.1016/0304-3975(86)90081-2},
  doi          = {10.1016/0304-3975(86)90081-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Ko86a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KruskalS86,
  author       = {Clyde P. Kruskal and
                  Marc Snir},
  title        = {A Unified Theory of Interconnection Network Structure},
  journal      = {Theor. Comput. Sci.},
  volume       = {48},
  number       = {3},
  pages        = {75--94},
  year         = {1986},
  url          = {https://doi.org/10.1016/0304-3975(86)90084-8},
  doi          = {10.1016/0304-3975(86)90084-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KruskalS86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MarekR86,
  author       = {V. Wiktor Marek and
                  Helena Rasiowa},
  title        = {Approximating Sets with Equivalence Relations},
  journal      = {Theor. Comput. Sci.},
  volume       = {48},
  number       = {3},
  pages        = {145--152},
  year         = {1986},
  url          = {https://doi.org/10.1016/0304-3975(86)90092-7},
  doi          = {10.1016/0304-3975(86)90092-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MarekR86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Salomaa86,
  author       = {Arto Salomaa},
  title        = {On a Public-Key Cryptosystem Based on Iterated Morphisms and Substitutions},
  journal      = {Theor. Comput. Sci.},
  volume       = {48},
  number       = {3},
  pages        = {283--296},
  year         = {1986},
  url          = {https://doi.org/10.1016/0304-3975(86)90099-X},
  doi          = {10.1016/0304-3975(86)90099-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Salomaa86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Spehner86a,
  author       = {Jean{-}Claude Spehner},
  title        = {La Reconnaissance des Facteurs d'un Mot dans un Texte},
  journal      = {Theor. Comput. Sci.},
  volume       = {48},
  number       = {3},
  pages        = {35--52},
  year         = {1986},
  url          = {https://doi.org/10.1016/0304-3975(86)90082-4},
  doi          = {10.1016/0304-3975(86)90082-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Spehner86a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Statman86,
  author       = {Richard Statman},
  title        = {Every Countable Poset is Embeddable in the Poset of Unsolvable Terms},
  journal      = {Theor. Comput. Sci.},
  volume       = {48},
  number       = {3},
  pages        = {95--100},
  year         = {1986},
  url          = {https://doi.org/10.1016/0304-3975(86)90085-X},
  doi          = {10.1016/0304-3975(86)90085-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Statman86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Tchuente86,
  author       = {Maurice Tchuent{\'{e}}},
  title        = {Sequential Simulation of Parallel Iterations and Applications},
  journal      = {Theor. Comput. Sci.},
  volume       = {48},
  number       = {3},
  pages        = {135--144},
  year         = {1986},
  url          = {https://doi.org/10.1016/0304-3975(86)90091-5},
  doi          = {10.1016/0304-3975(86)90091-5},
  timestamp    = {Wed, 25 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Tchuente86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Weispfenning86,
  author       = {Volker Weispfenning},
  title        = {The Complexity of the Word Problem for Abelian l-Groups},
  journal      = {Theor. Comput. Sci.},
  volume       = {48},
  number       = {3},
  pages        = {127--132},
  year         = {1986},
  url          = {https://doi.org/10.1016/0304-3975(86)90089-7},
  doi          = {10.1016/0304-3975(86)90089-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Weispfenning86.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.