Implementation and Application of Automata
From MaRDI portal
Publication:5463981
DOI10.1007/b105090zbMath1115.68444OpenAlexW4302765085WikidataQ56387363 ScholiaQ56387363MaRDI QIDQ5463981
No author found.
Publication date: 17 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b105090
Related Items
On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations ⋮ Left is Better Than Right for Reducing Nondeterminism of NFAs ⋮ Simplifications of Uniform Expressions Specified by Systems ⋮ A hitchhiker's guide to descriptional complexity through analytic combinatorics ⋮ Unnamed Item ⋮ On the Average Size of Glushkov’s Automata ⋮ Enumerating regular expressions and their languages ⋮ Analysis of an efficient reduction algorithm for random regular expressions based on universality detection ⋮ Efficient enumeration of regular expressions for faster regular expression synthesis ⋮ Concatenation-free languages
This page was built for publication: Implementation and Application of Automata
