The Complexity of Regular(-Like) Expressions
From MaRDI portal
Publication:3584879
DOI10.1007/978-3-642-14455-4_3zbMath1250.68160OpenAlexW1890214769MaRDI QIDQ3584879
Publication date: 31 August 2010
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14455-4_3
Related Items (4)
Extended regular expressions: succinctness and decidability ⋮ A hitchhiker's guide to descriptional complexity through analytic combinatorics ⋮ Descriptional complexity of two-way pushdown automata with restricted head reversals ⋮ Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals
This page was built for publication: The Complexity of Regular(-Like) Expressions
