scientific article; zbMATH DE number 2043550

MaRDI QIDQ4447254zbMATH OpenFDO

Authors Mahesh Viswanathan, Grigore Roşu

Publication date 16 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2706/27060499.htm

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• An Effective Algorithm for the Membership Problem for Extended Regular Expressions
• Rewriting extended regular expressions
• scientific article; zbMATH DE number 1929959
• Testing the equivalence of regular languages
• Symbolic solving of extended regular expression inequalities

Cited in

(8)

• Derivatives and partial derivatives for regular shuffle expressions
• From \(\omega\)-regular expressions to Büchi automata via partial derivatives
• Derivatives for Enhanced Regular Expressions
• Regular strategies as proof tactics for \textsf{CIRC}
• A decision procedure for regular membership and length constraints over unbounded strings
• Partial derivatives for context-free languages. From -regular expressions to pushdown automata
• Testing membership in parenthesis languages
• Mechanically proving termination using polynomial interpretations

Describes a project that uses

Uses Software

• JPAX
• Maude

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4447254)