Entry Clote:1986:FCP from tcs1985.bib

Last update: Thu Sep 27 02:46:57 MDT 2018                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Clote:1986:FCP,
  author =       "P. Clote",
  title =        "On the finite containment problem for {Petri} nets",
  journal =      j-THEOR-COMP-SCI,
  volume =       "43",
  number =       "1",
  pages =        "99--105",
  month =        may,
  year =         "1986",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Oct 26 07:53:56 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
  acknowledgement = ack-nhfb,
  classification = "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Boston Coll., Chestnut Hill, MA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Ackermann theorem; combinatorial mathematics;
                 combinatorial problems; directed graphs; finite
                 containment problem; infinite Ramsey Theorem; Petri
                 nets; reducibility",
  pubcountry =   "Netherlands A08",
  treatment =    "T Theoretical or Mathematical",
}

Related entries