Hostname: page-component-54dcc4c588-dbm8p Total loading time: 0 Render date: 2025-09-29T22:08:39.053Z Has data issue: false hasContentIssue false
  • English
  • Français

On Recognition of Shift Registers

Published online by Cambridge University Press:  12 September 2008

Janusz Szuster ,
Pawel Wlaź  and
Jerzy Żurawiecki
Janusz Szuster
Affiliation:
Department of Applied Mathematics, Lublin Technical University, Bernardyńska 13, 20–950 Lublin, Poland (Email {szuster, pwlaz, zuraw}@antenor.pol.lublin.pl)
Pawel Wlaź
Affiliation:
Department of Applied Mathematics, Lublin Technical University, Bernardyńska 13, 20–950 Lublin, Poland (Email {szuster, pwlaz, zuraw}@antenor.pol.lublin.pl)
Jerzy Żurawiecki
Affiliation:
Department of Applied Mathematics, Lublin Technical University, Bernardyńska 13, 20–950 Lublin, Poland (Email {szuster, pwlaz, zuraw}@antenor.pol.lublin.pl)
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper deals with infinite binary sequences. Each sequence is treated as generated by a nondeterministic shift register. A measure-theoretic criterion helpful in finding a deterministic generator of the set of sequences is proposed.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 5 , Issue 3 , September 1996 , pp. 307 - 315
Copyright
Copyright © Cambridge University Press 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1]Berlekamp, E. (1968) Algebraic Coding Theory. McGraw-Hill.Google Scholar
[2]Jackson, L. (1986) Digital Filters and Signal Processing. Kluwer.Google Scholar
[3]Mackhoul, J. (1975) Linear prediction: a tutorial review. Proc. IEEE 65 561–580.CrossRefGoogle Scholar
[4]Mykkeltveit, J. (1979) Nonlinear recurrences and arithmetic codes. Inform. & Control 33 193–209.CrossRefGoogle Scholar
[5]Grodzki, Z. (1977) Theory of nondeterministic shift registers. Demonstratio Math. 1 113–122.Google Scholar
[6]Arnold, A. and M. Nivat, M. (1980) The metric space of infinite trees. Algebraic and topological properties. J. Fund. Infor. 3(4) 445–476.Google Scholar
[7]Boasson, L. and Nivat, M. (1980) Adherences of languages. J. Comput. System Sci. 20(3) 285–309.CrossRefGoogle Scholar
[8]Redziejowski, R. (1986) Infinite word languages and continuous mappings. Theoret. Comput. Sci. 43(1) 59–80.CrossRefGoogle Scholar
[9]Lind, D. A. (1984) Application of ergodic theory and sofic systems to cellular automata. Phys. D 10 36–44.CrossRefGoogle Scholar
[10]Waterman, M. S. (1984) Some applications of information theory to cellular automata. Phys. D 10 45–51.CrossRefGoogle Scholar
[11]Wolfram, S. (1983) Statistical mechanics of cellular automata. Rev. Modern Phys. 55(3) 601–641.CrossRefGoogle Scholar