Entry Cherubini:1991:QFA 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{Cherubini:1991:QFA,
  author =       "A. Cherubini and C. Citrini and S. C. Reghizzi and D.
                 Mandrioli",
  title =        "{QRT FIFO} automata, breadth-first grammars and their
                 relations",
  journal =      j-THEOR-COMP-SCI,
  volume =       "85",
  number =       "1",
  pages =        "171--203",
  day =          "05",
  month =        aug,
  year =         "1991",
  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); C4220 (Automata theory)",
  corpsource =   "Dipartimento di Matematica, Politecnico di Milano,
                 Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "automata theory; breadth-first grammars; closure
                 properties; context-free grammars; counting
                 capabilities; deterministic machines; generative
                 system; homomorphism; multiqueue automata; periodicity
                 property; permutation; QRT FIFO automata;
                 quasi-real-time; queue automata; recognition power;
                 semilinear",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries