### Table 1: Regular expression operators.

1999

Cited by 24

### Table 1: Regular expression operators.

2000

Cited by 4

### Table 1: Regular expression operators.

2000

Cited by 4

### Table 6.1: Complexity classes for problems with regular expressions. All complexities are completeness results. For results already known in the lit- erature, the reference is added. The theorem numbers are given in brackets.

### 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

### Table 1. Complexity results for (uniform) membership problems

2006

"... In PAGE 2: ...nown for these problems, see e.g. [8]. Membership problems for tree automata were investigated in [13] for ranked trees (see Table1 for the results of [13]) and [14] for un- ranked trees from the perspective of computational complexity. Here we extend this line of research by investigating the computational complexity of membership problems for various classes of tree automata on compressed trees (dags and SL cf tree grammars).... In PAGE 2: ... For all cases, we present upper and lower bounds which vary from NL (nondeterministic logspace) to PSPACE (polynomial space). Our results are collected in Table1 . We also briefly consider the parameterized complexity [15] of membership problems for tree automata.... In PAGE 5: ... class of SL cf tree grammars (e.g., the class of all dags). The membership problem for the fixed TA A and the class G is the following decision problem: INPUT: G 2 G QUESTION: Does eval(G) 2 T(A) hold? For a class C of tree automata, the uniform membership problem for C and the class G is the following decision problem: INPUT: G 2 G and A 2 C QUESTION: Does eval(G) 2 T(A) hold? The upper part of Table1 collects the complexity results that were obtained in [13] for uncompressed trees. The statement that for instance the membership problem for TA is NC1-complete means that for every fixed TA the membership problem is in NC1 and that there exists a fixed TA for which the membership problem is NC1-hard.... In PAGE 7: ... Theorem 4 and 5) we obtain the complexity results for linear SL cf tree grammars with a fixed number of parameters (resp. unrestricted SL cf tree grammars) in Table1 , see lin.... ..."

Cited by 2