The Membership Problem for Regular Expressions with Unordered Concatenation and Numerical Constraints

DOI10.1007/978-3-642-28332-1_27zbMath1351.68140OpenAlexW2204191597WikidataQ59238608 ScholiaQ59238608MaRDI QIDQ2890202

Dag Hovland

Publication date: 8 June 2012

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10852/9052

zbMATH Keywords

XMLautomataregular expressionsinterleavingnumerical constraintsSGMLunordered concatenation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Definability by Weakly Deterministic Regular Expressions with Counters is Decidable ⋮ Fast matching of regular patterns with synchronizing counting ⋮ Schemas for unordered XML on a DIME ⋮ Inferring Deterministic Regular Expression with Unorder ⋮ Deciding determinism of regular languages ⋮ Unnamed Item ⋮ Checking determinism of regular expressions with counting

This page was built for publication: The Membership Problem for Regular Expressions with Unordered Concatenation and Numerical Constraints