The complexity of compressing subsegments of images described by finite automata

DOI10.1016/S0166-218X(02)00196-8zbMath1010.68075MaRDI QIDQ1861562

Wojciech Plandowski, Wojciech Rytter, Juhani Karhumäki

Publication date: 9 March 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

complexityfinite automatasquare images

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages ⋮ Binary operations on automatic functions ⋮ REPETITIONS, FULLNESS, AND UNIFORMITY IN TWO-DIMENSIONAL WORDS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of pattern matching for highly compressed two-dimensional texts.
• Finite Automata Computing Real Functions
• On continuous functions computed by finite automata
• Arithmetic coding of weighted finite automata
• Efficient algorithms for Lempel-Ziv encoding