ByteCode.News
Front PageTags
ByteCode.News
RSS
Front PageTags
← Knowledge Base

glushkov

By dreamreal|March 27, 2026|494 lookups
Text
glushkov is an algorithm for building an epsilon-free NFA directly from a regular expression. Unlike Thompson's construction, every transition consumes a symbol, which simplifies downstream determinization into a DFA.
Urls
https://en.wikipedia.org/wiki/Glushkov%27s_construction
Tags
automata, formal languages, compiler

Sign in to change this factoid.

← Back to Knowledge Base
bytecode.news

Technical writing, software engineering insights, and the craft of building things that work.

Sections

ArticlesFactoidsRSS ReaderKarmaLogsPoliciesTerms of ServiceAbout

System

Backend v1.17.0Frontend v2.0.10

© 2026 bytecode.news

All rights reserved