On the public citation graph
NFAs With and Without ε-Transitions
0 signed · 16 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jcss.2001.1748openalex-snapshot
Translating Regular Expressions into Small ε-Free Nondeterministic Finite Automata
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/s0020-0190(02)00436-2openalex-snapshot
A lower bound on the size of ε-free NFA corresponding to a regular expression
inferredcites →https://doi.org/10.1145/363347.363387openalex-snapshot
Programming Techniques: Regular expression search algorithm
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11672142_35openalex-snapshot
Regular Expressions and NFAs Without ε-Transitions
inferred← citeshttps://doi.org/10.1007/11753728_22openalex-snapshot
On a Maximal NFA Without Mergible States
inferred← citeshttps://doi.org/10.1007/11821069_28openalex-snapshot
Lower Bounds for the Transition Complexity of NFAs
inferred← citeshttps://doi.org/10.1007/978-3-030-81701-5_1openalex-snapshot
Hot Current Topics of Descriptional Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-73208-2_38openalex-snapshot
On Transition Minimality of Bideterministic Automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.034openalex-snapshot
Transition complexity of language operations
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.035openalex-snapshot
On the average state and transition complexity of finite languages
inferred← citeshttps://doi.org/10.1142/s012905410700498xopenalex-snapshot
PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA
inferred← citeshttps://doi.org/10.1142/s0129054115400110openalex-snapshot
From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity
inferred← citeshttps://doi.org/10.4204/eptcs.151.2openalex-snapshot
From Finite Automata to Regular Expressions and Back—A Summary on Descriptional Complexity
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.