Search dblp for Publications

export results for "toc:db/journals/mst/mst23.bht:"

 download as .bib file

@article{DBLP:journals/mst/Barrington90,
  author       = {David A. Mix Barrington},
  title        = {Extensions of an Idea of McNaughton},
  journal      = {Math. Syst. Theory},
  volume       = {23},
  number       = {3},
  pages        = {147--164},
  year         = {1990},
  url          = {https://doi.org/10.1007/BF02090772},
  doi          = {10.1007/BF02090772},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Barrington90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/BookT90,
  author       = {Ronald V. Book and
                  Shouwen Tang},
  title        = {Characterizing Polynomial Complexity Classes by Reducibilities},
  journal      = {Math. Syst. Theory},
  volume       = {23},
  number       = {3},
  pages        = {165--174},
  year         = {1990},
  url          = {https://doi.org/10.1007/BF02090773},
  doi          = {10.1007/BF02090773},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/BookT90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/CaiH90,
  author       = {Jin{-}yi Cai and
                  Lane A. Hemachandra},
  title        = {On the Power of Parity Polynomial Time},
  journal      = {Math. Syst. Theory},
  volume       = {23},
  number       = {2},
  pages        = {95--106},
  year         = {1990},
  url          = {https://doi.org/10.1007/BF02090768},
  doi          = {10.1007/BF02090768},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/CaiH90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/DiazT90,
  author       = {Josep D{\'{\i}}az and
                  Jacobo Tor{\'{a}}n},
  title        = {Classes of Bounded Nondeterminism},
  journal      = {Math. Syst. Theory},
  volume       = {23},
  number       = {1},
  pages        = {21--32},
  year         = {1990},
  url          = {https://doi.org/10.1007/BF02090764},
  doi          = {10.1007/BF02090764},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/DiazT90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/GreenbergHR90,
  author       = {David S. Greenberg and
                  Lenwood S. Heath and
                  Arnold L. Rosenberg},
  title        = {Optimal Embeddings of Butterfly-Like Graphs in the Hypercube},
  journal      = {Math. Syst. Theory},
  volume       = {23},
  number       = {1},
  pages        = {61--77},
  year         = {1990},
  url          = {https://doi.org/10.1007/BF02090766},
  doi          = {10.1007/BF02090766},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/GreenbergHR90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/Huynh90,
  author       = {Dung T. Huynh},
  title        = {The Complexity of Ranking Simple Languages},
  journal      = {Math. Syst. Theory},
  volume       = {23},
  number       = {1},
  pages        = {1--19},
  year         = {1990},
  url          = {https://doi.org/10.1007/BF02090763},
  doi          = {10.1007/BF02090763},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Huynh90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/KrishnamoorthyI90,
  author       = {Mukkai S. Krishnamoorthy and
                  Robert Ingalls},
  title        = {Guest Editors' Note: Special Issue in Honor of Robert McNaughton},
  journal      = {Math. Syst. Theory},
  volume       = {23},
  number       = {3},
  pages        = {143},
  year         = {1990},
  url          = {https://doi.org/10.1007/BF02090770},
  doi          = {10.1007/BF02090770},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/KrishnamoorthyI90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/KrishnamoorthyI90a,
  author       = {Mukkai S. Krishnamoorthy and
                  Robert Ingalls},
  title        = {Guest Editors' Note: Special Issue in Honor of Robert McNaughton},
  journal      = {Math. Syst. Theory},
  volume       = {23},
  number       = {4},
  pages        = {207},
  year         = {1990},
  url          = {https://doi.org/10.1007/BF02090775},
  doi          = {10.1007/BF02090775},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/KrishnamoorthyI90a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/Kutylowski90,
  author       = {Miroslaw Kutylowski},
  title        = {One-Way Multihead Finite Automata and 2-Bounded Languages},
  journal      = {Math. Syst. Theory},
  volume       = {23},
  number       = {2},
  pages        = {107--139},
  year         = {1990},
  url          = {https://doi.org/10.1007/BF02090769},
  doi          = {10.1007/BF02090769},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Kutylowski90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/McNaughton90,
  author       = {Robert McNaughton},
  title        = {Some Remarks},
  journal      = {Math. Syst. Theory},
  volume       = {23},
  number       = {3},
  pages        = {145--146},
  year         = {1990},
  url          = {https://doi.org/10.1007/BF02090771},
  doi          = {10.1007/BF02090771},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/McNaughton90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/Narendran90,
  author       = {Paliath Narendran},
  title        = {It is Decidable Whether a Monadic Thue System is Canonical Over a
                  Regular Set},
  journal      = {Math. Syst. Theory},
  volume       = {23},
  number       = {4},
  pages        = {245--254},
  year         = {1990},
  url          = {https://doi.org/10.1007/BF02090778},
  doi          = {10.1007/BF02090778},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Narendran90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/Parberry90,
  author       = {Ian Parberry},
  title        = {Single-Exception Sorting Networks and the Computational Complexity
                  of Optimal Sorting Network Verification},
  journal      = {Math. Syst. Theory},
  volume       = {23},
  number       = {2},
  pages        = {81--93},
  year         = {1990},
  url          = {https://doi.org/10.1007/BF02090767},
  doi          = {10.1007/BF02090767},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Parberry90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/Rosenberg90,
  author       = {Arnold L. Rosenberg},
  title        = {Exposing Graph Uniformities via Algebraic Specification},
  journal      = {Math. Syst. Theory},
  volume       = {23},
  number       = {4},
  pages        = {227--244},
  year         = {1990},
  url          = {https://doi.org/10.1007/BF02090777},
  doi          = {10.1007/BF02090777},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Rosenberg90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/StearnsH90,
  author       = {Richard Edwin Stearns and
                  Harry B. Hunt III},
  title        = {Power Indices and Easier Hard Problems},
  journal      = {Math. Syst. Theory},
  volume       = {23},
  number       = {4},
  pages        = {209--225},
  year         = {1990},
  url          = {https://doi.org/10.1007/BF02090776},
  doi          = {10.1007/BF02090776},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/StearnsH90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/Yen90,
  author       = {Hsu{-}Chun Yen},
  title        = {Communicating Processes, Scheduling, and the Complexity of Nondeterminism},
  journal      = {Math. Syst. Theory},
  volume       = {23},
  number       = {1},
  pages        = {33--59},
  year         = {1990},
  url          = {https://doi.org/10.1007/BF02090765},
  doi          = {10.1007/BF02090765},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Yen90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/ZhangK90,
  author       = {Hantao Zhang and
                  Deepak Kapur},
  title        = {Unnecessary Inferences in Associative-Commutative Completion Procedures},
  journal      = {Math. Syst. Theory},
  volume       = {23},
  number       = {3},
  pages        = {175--206},
  year         = {1990},
  url          = {https://doi.org/10.1007/BF02090774},
  doi          = {10.1007/BF02090774},
  timestamp    = {Tue, 17 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/ZhangK90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.