Deterministic regular expressions with interleaving

DOI10.1007/978-3-319-25150-9_13MaRDI QIDQ2787424zbMATH OpenOpenAlexFDO

Authors Feifei Peng, Haiming Chen, Xiaoying Mou

Publication date 25 February 2016

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

Full work available at URL https://doi.org/10.1007/978-3-319-25150-9_13

zbMATH Keywords

algorithmsinterleavingregular expressionsstrong determinismweak determinism

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms (68W40)

Recommendations

• Checking determinism of regular expressions with counting
• Checking determinism of regular expressions with counting
• Succinctness of regular expressions with interleaving, intersection and counting
• Succinctness of Regular Expressions with Interleaving, Intersection and Counting
• Regular expressions with counting: weak versus strong determinism

Cited in

(12)

• Intersection of \(-\omega \)-regular expressions
• Context-free grammars for deterministic regular expressions with interleaving
• Checking determinism of regular expressions with counting
• Efficient testing and matching of deterministic regular expressions
• An application of temporal projection to interleaving concurrency
• Checking determinism of regular expressions with counting
• Succinctness of Regular Expressions with Interleaving, Intersection and Counting
• scientific article; zbMATH DE number 2040946 (Why is no real title available?)
• Regular expressions with counting: weak versus strong determinism
• Regular Expressions with Counting: Weak versus Strong Determinism
• Location automata for regular expressions with shuffle and intersection
• Succinctness of regular expressions with interleaving, intersection and counting

This page was built for publication: Deterministic regular expressions with interleaving

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