Finite-State Complexity and the Size of Transducers

Details Finite-State Complexity and the Size of Transducers Finite-State Complexity and the Size of Transducers

2010-08-10

arxiv.org/abs/1008.1667v1

EPTCS 31, 2010, pp. 38-47

Computer Science

Formal Languages and Automata Theory

In Proceedings DCFS 2010, arXiv:1008.1270

Scientific paper

10.4204/EPTCS.31.6

Finite-state complexity is a variant of algorithmic information theory obtained by replacing Turing machines with finite transducers. We consider the state-size of transducers needed for minimal descriptions of arbitrary strings and, as our main result, we show that the state-size hierarchy with respect to a standard encoding is infinite. We consider also hierarchies yielded by more general computable encodings.

Affiliated with

Also associated with

No associations

Rating

Finite-State Complexity and the Size of Transducers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finite-State Complexity and the Size of Transducers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite-State Complexity and the Size of Transducers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-583335