Inclusion Test Algorithms for One-Unambiguous Regular Expressions

DOI10.1007/978-3-540-85762-4_7zbMATH Open1161.68519OpenAlexW1525895169MaRDI QIDQ5505596FDOQ5505596

Authors: 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

Recommendations

• Generalized one-unambiguity
• The inclusion problem for regular expressions
• The inclusion problem for regular expressions
• One-unambiguity of regular expressions with numeric occurrence indicators
• Efficient Inclusion Checking for Deterministic Tree Automata and DTDs

zbMATH Keywords

algorithminclusionone-unambiguous regular expression

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• CDuce: an XML-centric general-purpose language
• Introduction to algorithms
• THE ABSTRACT THEORY OF AUTOMATA
• Title not available (Why is that?)
• Title not available (Why is that?)
• Derivatives of Regular Expressions
• Partial derivatives of regular expressions and finite automaton constructions
• One-unambiguous regular languages
• Title not available (Why is that?)
• Regular expressions into finite automata
• Mathematical Foundations of Computer Science 2004
• Rewriting regular inequalities

Cited In (6)

• Efficient asymmetric inclusion of regular expressions with interleaving and counting for XML type-checking
• Efficient testing and matching of deterministic regular expressions
• The inclusion problem for regular expressions
• The inclusion problem for regular expressions
• One-unambiguity of regular expressions with numeric occurrence indicators
• Deciding definability by deterministic regular expressions

Uses Software

• CDuce
• XDuce

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

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