Inclusion Test Algorithms for One-Unambiguous Regular Expressions

DOI10.1007/978-3-540-85762-4_7zbMath1161.68519OpenAlexW1525895169MaRDI QIDQ5505596

Haiming Chen, Lei Chen

Publication date: 27 January 2009

Published in: Theoretical Aspects of Computing - ICTAC 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85762-4_7

zbMATH Keywords

algorithminclusionone-unambiguous regular expression

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Deciding definability by deterministic regular expressions ⋮ Efficient asymmetric inclusion of regular expressions with interleaving and counting for XML type-checking ⋮ The inclusion problem for regular expressions

Uses Software

• CDuce
• XDuce

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial derivatives of regular expressions and finite automaton constructions
• Regular expressions into finite automata
• THE ABSTRACT THEORY OF AUTOMATA
• Rewriting regular inequalities
• CDuce
• Mathematical Foundations of Computer Science 2004
• Derivatives of Regular Expressions
• One-unambiguous regular languages

This page was built for publication: Inclusion Test Algorithms for One-Unambiguous Regular Expressions