Entry Brazma:1986:GRE from tcs1985.bib

Last update: Thu Sep 27 02:46:57 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{Brazma:1986:GRE,
  author =       "A. Brazma and E. Kinber",
  title =        "Generalized regular expressions --- a language for
                 synthesis of programs with branching in loops",
  journal =      j-THEOR-COMP-SCI,
  volume =       "46",
  number =       "2--3",
  pages =        "175--195",
  month =        "????",
  year =         "1986",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4220 (Automata theory);
                 C6150G (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Comput. Centre, Latvian State Univ., Riga, Latvian
                 SSR, USSR",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "automata; automata theory; branching; equivalence
                 problem; finite alphabet; formal languages; generalised
                 regular expressions; inductive synthesis; loops;
                 natural numbers; program testing; programs synthesis
                 language; set-theoretic properties",
  pubcountry =   "Netherlands A04",
  treatment =    "T Theoretical or Mathematical",
}

Related entries