Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Ablyv:1988:CPP,
author = "F. M. Ablyv",
title = "The complexity properties of probabilistic automata
with isolated cut point",
journal = j-THEOR-COMP-SCI,
volume = "57",
number = "1",
pages = "87--95",
month = apr,
year = "1988",
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 = "C4220 (Automata theory)",
conflocation = "Bratislava, Czechoslovakia; 25-29 Aug. 1986",
conftitle = "International Symposium on Mathematical Foundations of
Computer Science",
corpsource = "Dept. of Math., Kazan State Univ., USSR",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; bounded error probability; complexity
properties; isolated cut point; probabilistic
automata",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}