Entry Slissenko:1993:FTS 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{Slissenko:1993:FTS,
  author =       "A. O. Slissenko",
  title =        "On fault tolerance of syntax",
  journal =      j-THEOR-COMP-SCI,
  volume =       "119",
  number =       "1",
  pages =        "215--222",
  day =          "11",
  month =        oct,
  year =         "1993",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:17:36 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=119&issue=1;
                 http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1993&volume=119&issue=1&aid=1450",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4220 (Automata theory); C4240
                 (Programming and algorithm theory); C6110B (Software
                 engineering techniques)",
  conflocation = "Grenoble, France; Oct. 1991",
  conftitle =    "5th Soviet-French Symposium on Theoretical Computer
                 Science, Methods and Tools for Compilation, and Program
                 Development (Informatika'91)",
  corpsource =   "St. Petersburg Inst. for Inf. and Autom., Acad. of
                 Sci., Russia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexity; computational complexity; context-free
                 languages; fault tolerance of syntax; fault tolerant
                 computing; finite automata; formal language; formal
                 languages; grammar; methods of estimation;
                 nondeterministic finite-automaton languages; quality;
                 software quality; software systems; time polynomial",
  pubcountry =   "Netherlands",
  treatment =    "P Practical",
}

Related entries