596 citations
- K. Nilsson5 profiles19 · h 63
- E. Lindfors4 profiles18 · h 69
- M. Tornikoski2 profiles16 · h 63
- K. Suominen14 · h 29
- L. Takalo13 · h 71
- E. Valtaoja12 · h 31
- M. Pasanen2 profiles12 · h 53
- S. Maniscalco12 · h 44
- Teiko Heinosaari2 profiles12 · h 29
- V. Larionov12 · h 60
- K. Wiik2 profiles11 · h 32
- L. Fuhrmann2 profiles11 · h 55
- Vaisala (Finland)FI52 papers
- Metsähallitus (Finland)FI23 papers
- National Institute for AstrophysicsIT16 papers
- University of HelsinkiFI15 papers
- University of MichiganUS13 papers
- AlbaNovaSE12 papers
- Centre National de la Recherche ScientifiqueFR11 papers
- Max Planck Institute for Radio AstronomyDE11 papers
- Instituto de Astrofísica de AndalucíaES10 papers
- Osservatorio Astrofisico di TorinoIT10 papers
- Queen's University BelfastGB10 papers
- Uppsala UniversitySE10 papers
4 papers · 1 filter
Traced communication complexity of cellular automata
Eric Goles, Pierre Guillon, Ivan Rapaport
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state of…
On Continuous Weighted Finite Automata
Jarkko Kari, Alexandr Kazda, Paula Steinby
We investigate the continuity of the ω-functions and real functions defined by weighted finite automata (WFA). We concentrate on the case of average preserving WFA. We show that ev…
Nondeterministic State Complexity of Positional Addition
Galina Jirásková, Alexander Okhotin
Consider nondeterministic finite automata recognizing base-k positional notation of numbers. Assume that numbers are read starting from their least significant digits. It is proved…
The equality problem for infinite words generated by primitive morphisms
Juha Honkala
We study the equality problem for infinite words obtained by iterating morphisms. In particular, we give a practical algorithm to decide whether or not two words generated by primi…