Entry Diekert:1990:WPT from tcs1990.bib

Last update: Wed Sep 26 02:11:46 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{Diekert:1990:WPT,
  author =       "V. Diekert",
  title =        "Word problems over traces which are solvable in linear
                 time",
  journal =      j-THEOR-COMP-SCI,
  volume =       "74",
  number =       "1",
  pages =        "3--18",
  day =          "30",
  month =        jul,
  year =         "1990",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:24:22 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic)",
  corpsource =   "Inst. fur Inf., Tech. Univ. Munchen, West Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "blocks; cones; confluence; decidability; decidable
                 word problem; finite complete replacement systems; free
                 partially commutative monoids; global condition; linear
                 time; noetherian trace replacement system; semi Thue
                 systems; trace replacement systems; vector replacement
                 systems; weight-reducing",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries