Entry Kudlek:1996:SDT 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{Kudlek:1996:SDT,
  author =       "Manfred Kudlek",
  title =        "Small deterministic {Turing} machines",
  journal =      j-THEOR-COMP-SCI,
  volume =       "168",
  number =       "2",
  pages =        "241--255",
  day =          "20",
  month =        nov,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:25 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=168&issue=2;
                 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=1996&volume=168&issue=2&aid=2280",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4210L (Formal languages and
                 computational linguistics); C4220 (Automata theory);
                 C4240 (Programming and algorithm theory)",
  conflocation = "Paris, France; 28-30 March 1995",
  conftitle =    "International Workshop on Universal Machines and
                 Computations",
  corpsource =   "Fachbereich Inf., Hamburg Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bi-infinite tape; computability; context-free
                 languages; decidability; decidable; deterministic
                 automata; deterministic linear context-free language;
                 DTM(4,7); DTM(5,6); DTM(l,n); DTM(m, 1); halting
                 problem; nonregular language; scanning head; small
                 deterministic Turing machines; Turing machines;
                 universal Turing machines",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries