Entry Droste:1995:RLC from tcs1995.bib

Last update: Sun Oct 15 02:56:11 MDT 2017                Valid HTML 3.2!

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{Droste:1995:RLC,
  author =       "Manfred Droste",
  title =        "Recognizable languages in concurrency monoids",
  journal =      j-THEOR-COMP-SCI,
  volume =       "150",
  number =       "1",
  pages =        "77--109",
  day =          "16",
  month =        oct,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:27 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=150&issue=1;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=150&issue=1&aid=1900",
  acknowledgement = ack-nhfb,
  classification = "C4220 (Automata theory)",
  corpsource =   "Fac. Math., Tech. Univ. Dresden, Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "binary relations; canonical congruence; concurrency
                 monoids; concurrency relations; finite automata; finite
                 computation sequences; formal languages; group theory;
                 Kleene-type characterization; labelled transition
                 systems; recognizable languages; trace theory",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries