Regular Expressions with Numerical Constraints and Automata with Counters
From MaRDI portal
Publication:3393412
DOI10.1007/978-3-642-03466-4_15zbMath1250.68161OpenAlexW1834456443WikidataQ59238626 ScholiaQ59238626MaRDI QIDQ3393412
Publication date: 20 August 2009
Published in: Theoretical Aspects of Computing - ICTAC 2009 (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1956/3628
Related Items (6)
Closure properties and descriptional complexity of deterministic regular expressions ⋮ Deciding definability by deterministic regular expressions ⋮ Definability by Weakly Deterministic Regular Expressions with Counters is Decidable ⋮ Fast matching of regular patterns with synchronizing counting ⋮ The tractability frontier for NFA minimization ⋮ Unnamed Item
This page was built for publication: Regular Expressions with Numerical Constraints and Automata with Counters
