• Embed Doc
  • Copy Link
  • Readcast
  • Collections
  • CommentGo Back
Download
 
AutomaticGroups and
B 
3
Chao XuAutomaticgroups
B 
3
as abiautomaticgroup
Automatic Groups and
B 
3
Chao XuJuly 11, 2011
 
AutomaticGroups and
B 
3
Chao XuAutomaticgroups
B 
3
as abiautomaticgroup
Automatic Groups
Definition
(
A
,
L
)
is the
automatic structure 
of 
G 
, if the alphabet
A
is thesemigroup generator of 
G 
, and if the following are true.
1
There exist an FSA on
A
, the
word acceptor 
,
W 
, suchthat
L
=
L
(
W 
)
and
π
:
L
(
W 
)
→
G 
is injective.
2
There exist a
M 
g 
on
(
A
,
A
) =
{
(
x 
,
y 
)
|
x 
,
y 
∈
A
}
for everygenerator
g 
∈
G 
, such that
M 
g 
accept words
(
w 
,
w 
)
if and only if 
π
(
w 
)
g 
=
π
(
w 
)
.
M 
accept words
(
w 
,
w 
)
,such that
π
(
w 
) =
π
(
w 
)
.
M 
g 
is called a
multiplier automaton
,
M 
is called the
equality recognizer 
.The automatic groups are groups with automatic structures.
 
AutomaticGroups and
B 
3
Chao XuAutomaticgroups
B 
3
as abiautomaticgroup
Fellow Traveler Property
π
:
L
→
G 
is a surjection, where
L
is regular.
L
has the fellowtraveler property if for any two word
w 
,
w 
∈
L
, such that
π
(
w 
)
and
π
(
w 
)
differs by one generator
x 
, the distance between
w 
,
w 
at time
t 
is on is at most a constant
m
apart. Let thesmallest of the constants be
K 
.The distance between
w 
,
w 
,
d 
(
w 
,
w 
)
is defined as thedistance of 
π
(
w 
)
,π
(
w 
)
in the Cayley graph.
w 
at time
t 
, denoted as
w 
(
t 
)
, is the prefix of 
w 
with length
t 
.If 
t 
≥
len
(
w 
)
,
w 
(
t 
) =
w 
.
of 00

Leave a Comment

You must be to leave a comment.
Submit
Characters: ...
You must be to leave a comment.
Submit
Characters: ...