Inferring Deterministic Regular Expression with Unorder

DOI10.1007/978-3-030-38919-2_27zbMath1440.68061OpenAlexW3000088020MaRDI QIDQ3297778

Haiming Chen, Xiao Fan Wang

Publication date: 20 July 2020

Published in: SOFSEM 2020: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-38919-2_27

zbMATH Keywords

automataregular expressionsschema inferenceunorder

Mathematics Subject Classification ID

Computational learning theory (68Q32) Database theory (68P15) Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Highly expressive query languages for unordered data trees
• Fast learning of restricted regular expressions and dtds
• Schemas for unordered XML on a DIME
• The Membership Problem for Regular Expressions with Unordered Concatenation and Numerical Constraints
• Complexity and Expressiveness of ShEx for RDF
• One-unambiguous regular languages

This page was built for publication: Inferring Deterministic Regular Expression with Unorder