In order for finite-state networks to be useful for linguistic processing, we provide a regular expression language denoting FSRAs.
we provide a set of extended regular expression operators that denote FSRAs and FSRTs.