Rewriting Regular Inequalities (Extended Abstract)

[1]  L. Bernátsky,et al.  Equational Properties of Kleene Algebras of Relations with Conversion , 1995, Theor. Comput. Sci..

[2]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[3]  Valentin M. Antimirov.  Partial Derivates of Regular Expressions and Finite Automata Constructions , 1995, STACS.

[4]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[5]  José Meseguer,et al.  Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations , 1992, Theor. Comput. Sci..

[6]  Valentin M. Antimirov.  Partial Derivatives of Regular Expressions and Finite Automaton Constructions , 1996, Theor. Comput. Sci..

[7]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[8]  Tao Jiang,et al.  Minimal NFA Problems are Hard , 1991, SIAM J. Comput..

[9]  Dominique Perrin,et al.  Finite Automata , 1958, Philosophy.

[10]  V N Redko,et al.  On the determinative aggregate of relationships of the algebra of regular events , 1964 .

[11]  Janusz A. Brzozowski,et al.  Derivatives of Regular Expressions , 1964, JACM.

[12]  J. Conway.  Regular algebra and finite machines , 1971 .

[13]  Sheng Yu,et al.  The State Complexities of Some Basic Operations on Regular Languages , 1994, Theor. Comput. Sci..

[14]  T. G. Szymanski,et al.  On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages , 1976, J. Comput. Syst. Sci..

[15]  Peter D. Mosses,et al.  Rewriting Extended Regular Expressions , 1993, International Conference on Developments in Language Theory.