Complexity of regular functions

descriptionPublicationkeyboard_double_arrow_right Article , Part of book or chapter of book , Other literature type , Conference object 01 Jan 2015Embargo end date: 24 Feb 2016 English Publisher:Elsevier BVJournal:Journal of Computer and System Sciences, volume 104, pages 5-16 (issn: 0022-0000,

Copyright policy )

Authors: Eric Allender; Ian Mertz;

doi: 10.1016/j.jcss.2016.10.005 , 10.1007/978-3-319-15579-1_35 , 10.7282/t31j9cnd , 10.7282/t3qc05rb

Complexity of regular functions

- Summary
- Subjects
- Metrics

Abstract

We give complexity bounds for various classes of functions computed by cost register automata.

9th International Conference, LATA 2015, Nice, France, March 2-6, 2015

Related Organizations

Rutgers, The State University of New Jersey
United States

Keywords

Computational complexity, computational complexity, Computational Complexity, Analysis of algorithms and problem complexity, Transducers, transducers, Formal languages and automata, weighted automata, Weighted automata

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	5
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average