Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/AlbertL85,
  author       = {Michael H. Albert and
                  John Lawrence},
  title        = {A Proof of Ehrenfeucht's Conjecture},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {121--123},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90066-0},
  doi          = {10.1016/0304-3975(85)90066-0},
  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AlbertL85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Bunder85a,
  author       = {Martin W. Bunder},
  title        = {Possible Forms of Evaluation or Reduction in Martin-L{\"{o}}f
                  Type Theory},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {113--120},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90065-9},
  doi          = {10.1016/0304-3975(85)90065-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Bunder85a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Cazanescu85,
  author       = {Virgil Emil Cazanescu},
  title        = {On Context-Free Trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {33--50},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90058-1},
  doi          = {10.1016/0304-3975(85)90058-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Cazanescu85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Ch85,
  author       = {Eric Goles Ch.},
  title        = {Dynamics of Positive Automata Networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {19--32},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90057-X},
  doi          = {10.1016/0304-3975(85)90057-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Ch85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DahlhausG85,
  author       = {Elias Dahlhaus and
                  Haim Gaifman},
  title        = {Concerning Two-Adjacent Context-Free Languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {169--184},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90069-6},
  doi          = {10.1016/0304-3975(85)90069-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DahlhausG85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Gohon85,
  author       = {Philippe Gohon},
  title        = {An Algorithm to Decide Whether a Rational Subset of Nk is Recognizable},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {51--59},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90059-3},
  doi          = {10.1016/0304-3975(85)90059-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Gohon85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GrantM85,
  author       = {John Grant and
                  Jack Minker},
  title        = {Inferences for Numerical Dependencies},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {271--287},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90075-1},
  doi          = {10.1016/0304-3975(85)90075-1},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/GrantM85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Hayashi85,
  author       = {Susumu Hayashi},
  title        = {Adjunction of Semifunctors: Categorical Structures in Nonextensional
                  Lambda Calculus},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {95--104},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90062-3},
  doi          = {10.1016/0304-3975(85)90062-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Hayashi85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Heide85,
  author       = {Friedhelm Meyer auf der Heide},
  title        = {Simulating Probabilistic by Deterministic Algebraic Computation Trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {325--330},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90079-9},
  doi          = {10.1016/0304-3975(85)90079-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Heide85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Helfrich85,
  author       = {Bettina Helfrich},
  title        = {Algorithms to Construct Minkowski Reduced an Hermite Reduced Lattice
                  Bases},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {125--139},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90067-2},
  doi          = {10.1016/0304-3975(85)90067-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Helfrich85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Hirokawa85,
  author       = {Sachio Hirokawa},
  title        = {Complexity of the Combinator Reduction Machine},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {289--303},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90076-3},
  doi          = {10.1016/0304-3975(85)90076-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Hirokawa85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/IbarraPK85,
  author       = {Oscar H. Ibarra and
                  Michael A. Palis and
                  Sam M. Kim},
  title        = {Fast Parallel Language Recognition by Cellular Automata},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {231--246},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90073-8},
  doi          = {10.1016/0304-3975(85)90073-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/IbarraPK85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Iliopoulos85,
  author       = {Costas S. Iliopoulos},
  title        = {Computing in General Abelian Groups is Hard},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {81--93},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90061-1},
  doi          = {10.1016/0304-3975(85)90061-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Iliopoulos85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/InoueTV85,
  author       = {Katsushi Inoue and
                  Itsuo Takanami and
                  Roland Vollmar},
  title        = {Alternating On-Line Turing Machines with Only Universal States and
                  Small Space Bounds},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {331--339},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90080-5},
  doi          = {10.1016/0304-3975(85)90080-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/InoueTV85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Karhumaki85a,
  author       = {Juhani Karhum{\"{a}}ki},
  title        = {A Property of Three-Element Codes},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {215--222},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90071-4},
  doi          = {10.1016/0304-3975(85)90071-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Karhumaki85a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Maon85,
  author       = {Yael Maon},
  title        = {On the Equivalence Problem of Compositions of Morphisms and Inverse
                  Morphisms on Context-Free Languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {105--107},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90063-5},
  doi          = {10.1016/0304-3975(85)90063-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Maon85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MonienS85,
  author       = {Burkhard Monien and
                  Ivan Hal Sudborough},
  title        = {Bandwidth Constrained NP-Complete Problems},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {141--167},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90068-4},
  doi          = {10.1016/0304-3975(85)90068-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MonienS85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Paun85,
  author       = {Gheorghe Paun},
  title        = {A Variant of Random Context Grammars: Semi-Conditional Grammars},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {1--17},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90056-8},
  doi          = {10.1016/0304-3975(85)90056-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Paun85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Pelz85,
  author       = {Elisabeth Pelz},
  title        = {On the Complexity of Theories of Permutations},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {247--269},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90074-X},
  doi          = {10.1016/0304-3975(85)90074-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Pelz85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Reisig85,
  author       = {Wolfgang Reisig},
  title        = {Petri Nets with Individual Tokens},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {185--213},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90070-2},
  doi          = {10.1016/0304-3975(85)90070-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Reisig85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/RestR85,
  author       = {Evelyne Barbin{-}Le Rest and
                  Michel Le Rest},
  title        = {Sur la Combinatoire des Codes {\`{a}} Deux Mots},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {61--80},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90060-X},
  doi          = {10.1016/0304-3975(85)90060-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/RestR85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Slutzki85,
  author       = {Giora Slutzki},
  title        = {Alternating Tree Automata},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {305--318},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90077-5},
  doi          = {10.1016/0304-3975(85)90077-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Slutzki85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Stoss85,
  author       = {Hans{-}J{\"{o}}rg Sto{\ss}},
  title        = {The Complexity of Evaluating Interpolation Polynomials},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {319--323},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90078-7},
  doi          = {10.1016/0304-3975(85)90078-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Stoss85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Thibon85,
  author       = {Jean{-}Yves Thibon},
  title        = {Integrit{\'{e}} des Alg{\`{e}}bres de S{\'{e}}ries Formelles
                  sur un Alphabet Partiellement Commutatif},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {109--112},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90064-7},
  doi          = {10.1016/0304-3975(85)90064-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Thibon85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/TomitaS85,
  author       = {Etsuji Tomita and
                  Kazushi Seino},
  title        = {A Weaker Sufficient Condition for the Equivalence of a Pair of DPDA's
                  to be Decidable},
  journal      = {Theor. Comput. Sci.},
  volume       = {41},
  pages        = {223--230},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90072-6},
  doi          = {10.1016/0304-3975(85)90072-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/TomitaS85.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.