Entry McAloon:1984:PNL from tcs1980.bib

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

Index sections

Top | 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{McAloon:1984:PNL,
  author =       "D. McAloon",
  title =        "{Petri} nets and large finite sets",
  journal =      j-THEOR-COMP-SCI,
  volume =       "32",
  number =       "1--2",
  pages =        "173--183",
  month =        jul,
  year =         "1984",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory)",
  corpsource =   "Brooklyn Coll., City Univ. of New York, New York, NY,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "Ackermann function; complexity; computability;
                 computational complexity; finite containment problem;
                 graph theory; Karp-Miller decision procedure;
                 Ketonen-Salovay; large finite sets; Paris-Harrington;
                 Petri nets; primitive recursive procedure; search
                 length bounds; set theory; upper bound",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries