On the public citation graph

Computing ε-free NFA from regular expressions in O(n log2(N)) time

https://doi.org/10.1007/bfb0055777
0 signed · 31 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bfb0023448openalex-snapshot
Translating regular expressions into small ε-free nondeterministic finite automata
inferredcites →https://doi.org/10.1016/0304-3975(86)90088-5openalex-snapshot
From regular expressions to deterministic automata
inferredcites →https://doi.org/10.1016/0304-3975(93)90287-4openalex-snapshot
Regular expressions into finite automata
inferredcites →https://doi.org/10.1016/0377-2217(90)90106-lopenalex-snapshot
Efficient parallel algorithms
inferredcites →https://doi.org/10.1016/s0022-0000(76)80034-7openalex-snapshot
Complexity measures for regular expressions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jcss.2001.1748openalex-snapshot
Translating Regular Expressions into Small ε-Free Nondeterministic Finite Automata
inferred← citeshttps://doi.org/10.1007/11496656_27openalex-snapshot
Reducing the Size of NFAs by Using Equivalences and Preorders
inferred← citeshttps://doi.org/10.1007/11605157_2openalex-snapshot
The Language, the Expression, and the (Small) Automaton
inferred← citeshttps://doi.org/10.1007/11672142_35openalex-snapshot
Regular Expressions and NFAs Without ε-Transitions
inferred← citeshttps://doi.org/10.1007/11812128_4openalex-snapshot
Path-Equivalent Removals of ε-transitions in a Genomic Weighted Finite Automaton
inferred← citeshttps://doi.org/10.1007/3-540-44669-9_20openalex-snapshot
On the Complexity of Decidable Cases of Commutation Problem for Languages
inferred← citeshttps://doi.org/10.1007/3-540-44674-5_7openalex-snapshot
New Finite Automaton Constructions Based on Canonical Derivatives
inferred← citeshttps://doi.org/10.1007/3-540-45005-x_3openalex-snapshot
Efficient Transformations from Regular Expressions to Finite Automata
inferred← citeshttps://doi.org/10.1007/3-540-45452-7_23openalex-snapshot
Constructing NFAs by Optimal Use of Positions in Regular Expressions
inferred← citeshttps://doi.org/10.1007/3-540-45687-2_27openalex-snapshot
Algorithms for Computing Small NFAs
inferred← citeshttps://doi.org/10.1007/3-540-48194-x_15openalex-snapshot
Computing the Equation Automaton of a Regular Expression in O(s 2) Space and Time
inferred← citeshttps://doi.org/10.1007/978-3-540-27812-2_11openalex-snapshot
On NFA Reductions
inferred← citeshttps://doi.org/10.1007/978-3-540-30500-2_9openalex-snapshot
Computing the Follow Automaton of an Expression
inferred← citeshttps://doi.org/10.1007/978-3-540-70844-5_1openalex-snapshot
Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-76336-9_11openalex-snapshot
Deterministic Caterpillar Expressions
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_25openalex-snapshot
Multi-tilde Operators and Their Glushkov Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_53openalex-snapshot
On the Average Size of Glushkov’s Automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.03.073openalex-snapshot
On the complexity of decidable cases of the commutation problem of languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.12.036openalex-snapshot
Parameterized regular expressions and their languages
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00090-7openalex-snapshot
Follow automata
inferred← citeshttps://doi.org/10.1051/ita:2007035openalex-snapshot
Efficient weighted expressions conversion
inferred← citeshttps://doi.org/10.1142/s0129054102000972openalex-snapshot
EVALUATION OF THREE IMPLICIT STRUCTURES TO IMPLEMENT NONDETERMINISTIC AUTOMATA FROM REGULAR EXPRESSIONS
inferred← citeshttps://doi.org/10.1142/s012905410700498xopenalex-snapshot
PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA
inferred← citeshttps://doi.org/10.1145/1066677.1066992openalex-snapshot
Compiling regular patterns to sequential machines
inferred← citeshttps://doi.org/10.1145/3233183openalex-snapshot
Scalable Analysis for Multi-Scale Dataflow Models
inferred← citeshttps://doi.org/10.3233/fi-2014-1033openalex-snapshot
On the Transition Reduction Problem for Finite Automata
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.