Better Complexity Bounds for Cost Register Automata

dc.contributor.author	Krebs, Andreas
dc.date.accessioned	2020-05-07T13:39:40Z
dc.date.available	2020-05-07T13:39:40Z
dc.date.issued	2019
dc.identifier.issn	1433-0490
dc.identifier.uri	http://hdl.handle.net/10900/100352
dc.language.iso	en	en
dc.publisher	Springer	de_DE
dc.relation.uri	http://dx.doi.org/10.1007/s00224-018-9871-4
dc.subject.ddc	004	de_DE
dc.subject.ddc	510	de_DE
dc.title	Better Complexity Bounds for Cost Register Automata	de_DE
dc.type	Article	de_DE
utue.quellen.id	20190926111821_01980
utue.publikation.seiten	367-385	de_DE
utue.personen.roh	Allender, Eric
utue.personen.roh	Krebs, Andreas
utue.personen.roh	McKenzie, Pierre
dcterms.isPartOf.ZSTitelID	Theory of Computing Systems	de_DE
dcterms.isPartOf.ZS-Issue	3	de_DE
dcterms.isPartOf.ZS-Volume	63	de_DE
utue.fakultaet	07 Mathematisch-Naturwissenschaftliche Fakultät