State Elimination Ordering Strategies: Some Experimental Results

Moreira, Nelma; Nabais, Davide; Reis, Rui L.

doi:10.4204/eptcs.31.16

Cited by 6 publications

(12 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As observed from the benchmark results, both heuristic strategies yield more compact regular expressions as compared to the default solving orders. Similar results were reported for the state elimination method in [15]. The source code of the benchmark can be found in [14].…”

Section: D2 Cycle Counting Heuristicssupporting

confidence: 74%

“…This issue has been addressed in the state elimination setting where via some heuristics certain states are favored to obtain short regular expressions. Moreira, Nabais, and Reis [15] discuss a number of heuristics. Two of them were reported to be the most effective for a wide set of test cases.…”

Section: Methodsmentioning

confidence: 99%

“…Cycle counting is another effective heuristic strategy reported in [15]. The idea of this heuristics is to treat the regular equations as a directed graph and use the number of unique cycles as the weight.…”

Section: D2 Cycle Counting Heuristicsmentioning

confidence: 99%

“…The state elimination method appears to be better studied in the literature. For example, see the works [1,12,15] that discuss heuristics to obtain short regular expressions.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Solving of Regular Equations Revisited

Sulzmann

2019

Theoretical Aspects of Computing – ICTAC 2019

View full text Add to dashboard Cite

Solving of regular equations via Arden's Lemma is folklore knowledge. We first give a concise algorithmic specification of all elementary solving steps. We then discuss a computational interpretation of solving in terms of coercions that transform parse trees of regular equations into parse trees of solutions. Thus, we can identify some conditions on the shape of regular equations under which resulting solutions are unambiguous. We apply our result to convert a DFA to an unambiguous regular expression. In addition, we show that operations such as subtraction and shuffling can be expressed via some appropriate set of regular equations. Thus, we obtain direct (algebraic) methods without having to convert to and from finite automaton.

show abstract

Section: D2 Cycle Counting Heuristicssupporting

confidence: 74%

Section: Methodsmentioning

confidence: 99%

Section: D2 Cycle Counting Heuristicsmentioning

confidence: 99%

“…The state elimination method appears to be better studied in the literature. For example, see the works [1,12,15] that discuss heuristics to obtain short regular expressions.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Solving of Regular Equations Revisited

Sulzmann

2019

Theoretical Aspects of Computing – ICTAC 2019

View full text Add to dashboard Cite

show abstract

“…Various heuristics for computing elimination orderings have been compared empirically on a large set of random DFAs as input in [31]. There it turned out that a simple greedy heuristic for choosing an elimination ordering [14,54] is most effective.…”

Section: From Finite Automata To Regular Expressionsmentioning

confidence: 99%

The Complexity of Regular(-Like) Expressions

Holzer

Kutrib

2011

Int. J. Found. Comput. Sci.

View full text Add to dashboard Cite

We summarize results on the complexity of regular(-like) expressions and tour a fragment of the literature. In particular we focus on the descriptional complexity of the conversion of regular expressions to equivalent finite automata and vice versa, to the computational complexity of problems on regular-like expressions such as, e.g., membership, inequivalence, and non-emptiness of complement, and finally on the operation problem measuring the required size for transforming expressions with additional language operations (built-in or not) into equivalent ordinary regular expressions.

show abstract

Universal provenance for regular path queries

Grahne

Liu

Shiri

2022

Proceedings of the 14th International Workshop on the Theory and Practice of Provenance

View full text Add to dashboard Cite

We study the question of universal provenance for regular path queries in graph databases. Universal provenance was introduced by Green, Karvounarakis, and Tannen in 2007 as the most general form of semiring provenance for positive relational algebra query results. According to this methodology, the universal provenance is to be computed during query evaluation, and any application provenance, such as e.g. the multiplicity of a tuple in the answer, can then be obtained by a homomorphic projection from the universal provenance. The methodology has subsequently been applied to SPARQL-queries and queries expressed in first order and fixed point logics, but for regular path queries only application provenance has been considered. We remedy the situation in this paper, by elucidating the classical theoretical framework and results that enable us to show that certain regular expressions form the universal provenance for regular path queries. In addition, we show experimentally that computing the universal provenance, as opposed to computing the application provenance directly, does not incur any significant overhead.

show abstract

State Elimination Ordering Strategies: Some Experimental Results

Cited by 6 publications

References 23 publications

Solving of Regular Equations Revisited

Solving of Regular Equations Revisited

The Complexity of Regular(-Like) Expressions

Universal provenance for regular path queries

Contact Info

Product

Resources

About