### Table 1: Regular expression operators.

2000

Cited by 4

### Table 1: Regular expression operators.

2000

Cited by 4

### Table 1: Semigroups satisfying x

"... In PAGE 2: ... 3. Is the congruence #18 m;n on A #03 decidable? In other words: Is the free word #28iden- tity#29 problem for the variety de#0Cned by #28associativityand#29x m+n = x n recursively solvable? The top-left case #28m =1,n =0#29of Table1 is a trivial algebra. Thenextcaseof the top row#28m; n = 1#29, the #28free#29 idempotent semigroups, are called #28free#29 bands.... In PAGE 3: ... Green and Rees #5B 1952 #5D proved that x m = 1 is #0Cnite if and only if the semigroup x m+1 = x is. So columns 1 and 2 of Table1 haveidentical #0Cniteness properties. In particular, bands #28xx = x#29 are #0Cnite.... ..."

### Table 1: Regular expression operators.

1999

Cited by 24

### Table 1: Basic regular expression operators in FSA5.

1999

"... In PAGE 2: ... We illustrate the exendible regular expression compiler with a number of examples taken from recent publications in the area of finite-state approaches to NLP. 2 Regular Expressions Table1 gives an overview of the basic regular expression operators provided by FSA5. Apart from the standard regular expression operators and extended regular expression operators for regular languages, the tool-box also provides regular expression operators for regular relations.... ..."

Cited by 13

### Table 1: Basic regular expression operators in FSA5.

in An Extendible Regular Expression Compiler for Finite-state Approaches in Natural Language Processing

1999

"... In PAGE 2: ... We illustrate the exendible regular expression compiler with a number of examples taken from recent publications in the area of finite-state approaches to NLP. 2 Regular Expressions Table1 gives an overview of the basic regular expression operators provided by FSA5. Apart from the standard regular expression operators and extended regular expression operators for regular languages, the tool-box also provides regular expression operators for regular relations.... ..."

Cited by 13

### Table 1: Basic regular expression operators in FSA5.

1999

"... In PAGE 2: ... We illustrate the exendible regular expression compiler with a number of examples taken from recent publications in the area of nite-state approaches to NLP. 2 Regular Expressions Table1 gives an overview of the basic regular expression operators provided by FSA5. Apart from the standard regular expression operators and extended regular expression operators for regular languages, the tool-box also provides regular expression operators for regular relations.... ..."

Cited by 13