Checking determinism of regular expressions with counting

DOI10.1007/978-3-642-31653-1_30MaRDI QIDQ3167507zbMATH OpenOpenAlexFDO

Authors Haiming Chen, Ping Lu

Publication date 2 November 2012

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31653-1_30

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Regular Expressions with Counting: Weak versus Strong Determinism
• Regular expressions with counting: weak versus strong determinism
• Checking determinism of regular expressions with counting
• Deciding determinism of regular languages
• Deterministic regular expressions with interleaving

Cited in

(9)

• Checking determinism of regular expressions with counting
• Efficient testing and matching of deterministic regular expressions
• Deterministic regular expressions with interleaving
• Definability by weakly deterministic regular expressions with counters is decidable
• Deciding determinism of regular languages
• Quantitative Verification of Stochastic Regular Expressions
• Regular expressions with counting: weak versus strong determinism
• Regular Expressions with Counting: Weak versus Strong Determinism
• Succinct determinisation of counting automata via sphere construction

This page was built for publication: Checking determinism of regular expressions with counting

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