Checking Determinism of Regular Expressions with Counting

DOI10.1007/978-3-642-31653-1_30zbMath1370.68166OpenAlexW2126678643MaRDI QIDQ3167507

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)

Related Items (3)

Definability by Weakly Deterministic Regular Expressions with Counters is Decidable ⋮ Deciding determinism of regular languages ⋮ Checking determinism of regular expressions with counting

This page was built for publication: Checking Determinism of Regular Expressions with Counting