Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Herzog:1997:PAB,
author = "Christian Herzog",
title = "Pushdown automata with bounded nondeterminism and
bounded ambiguity",
journal = j-THEOR-COMP-SCI,
volume = "181",
number = "1",
pages = "141--157",
day = "15",
month = jul,
year = "1997",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:01 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=181&issue=1;
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=1997&volume=181&issue=1&aid=2469",
acknowledgement = ack-nhfb,
classification = "C4210L (Formal languages and computational
linguistics); C4220 (Automata theory)",
conflocation = "Valparaiso, Chile; 3-7 April 1995",
conftitle = "Second International Symposium on Latin American
Theoretical Informatics",
corpsource = "Fachbereich Inf., J. W. Goethe-Univ., Frankfurt,
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "ambiguity; bounded ambiguity; bounded nondeterminism;
branching; context-free grammars; context-free
languages; nondeterminism; pushdown automata; recursive
function; recursive functions; tradeoff",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}