๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The complexity of some reachability problems for a system on a finite group

โœ Scribed by Christian Golaszewski; Peter J. Ramadge


Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
330 KB
Volume
12
Category
Article
ISSN
0167-6911

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A note on the space complexity of some d
โœ Tao Jiang; B. Ravikumar ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 533 KB

In this note, we establish the space complexity of decision problems (such as membership, nonemptiness and equivalence) for some finite automata. Our study includes 2-way infinite automata with a pebble.

The structure of magnetic translation gr
โœ A. Wal ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 182 KB

The symmetry group (magnetic translation group) of a Bloch electron in a finite two-dimensional lattice in a perpendicular magnetic field is discussed. The details of the structure of this group depend on a gauge of a vector potential of a magnetic field. For two gauges, symmetric and Landau, the gr