On the public citation graph

Regular Expressions and NFAs Without ε-Transitions

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.1006/jcss.2001.1748openalex-snapshot
Translating Regular Expressions into Small ε-Free Nondeterministic Finite Automata
inferredcites →https://doi.org/10.1007/11523468_32openalex-snapshot
NFAs With and Without ε-Transitions
inferredcites →https://doi.org/10.1007/978-3-642-61345-6openalex-snapshot
Parsing Theory
inferredcites →https://doi.org/10.1007/bfb0055777openalex-snapshot
Computing ε-free NFA from regular expressions in O(n log2(N)) time
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
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.1016/s0022-0000(03)00036-9openalex-snapshot
Translation of binary regular expressions into nondeterministic ε-free automata with O(nlogn) transitions
inferredcites →https://doi.org/10.1051/ita:2000116openalex-snapshot
Computingϵ-Free NFA from Regular Expressions inO(nlog2(n)) Time
inferredcites →https://doi.org/10.1070/rm1961v016n05abeh004112openalex-snapshot
THE ABSTRACT THEORY OF AUTOMATA
inferredcites →https://doi.org/10.1109/t-c.1971.223204openalex-snapshot
Ambiguity in Graphs and Expressions
inferredcites →https://doi.org/10.1145/363347.363387openalex-snapshot
Programming Techniques: Regular expression search algorithm
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-032-02602-6_19openalex-snapshot
From Regular Expressions to Deterministic Finite Automata: $$2^{\frac{n}{2}+\sqrt{n}(\log n)^{\varTheta (1)}}$$ States Are Necessary and Sufficient
inferred← citeshttps://doi.org/10.1007/978-3-319-09704-6_16openalex-snapshot
Biclique Coverings, Rectifier Networks and the Cost of ε-Removal
inferred← citeshttps://doi.org/10.1007/978-3-319-15579-1_58openalex-snapshot
Sublinear DTD Validity
inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_3openalex-snapshot
The Tractability Frontier for NFA Minimization
inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_4openalex-snapshot
Finite Automata, Digraph Connectivity, and Regular Expression Size
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-73208-2_6openalex-snapshot
Descriptional Complexity of Nondeterministic Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-76336-9_11openalex-snapshot
Deterministic Caterpillar Expressions
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_20openalex-snapshot
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_3openalex-snapshot
On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes
inferred← citeshttps://doi.org/10.1007/978-3-642-14455-4_3openalex-snapshot
The Complexity of Regular(-Like) Expressions
inferred← citeshttps://doi.org/10.1007/978-3-642-19222-7_39openalex-snapshot
Regular Language Constrained Sequence Alignment Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_46openalex-snapshot
Online Matching of Multiple Regular Patterns with Gaps and Character Classes
inferred← citeshttps://doi.org/10.1007/978-3-642-38771-5_31openalex-snapshot
Deciding Determinism of Unary Languages Is coNP-Complete
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.03.001openalex-snapshot
The tractability frontier for NFA minimization
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.2009.03.010openalex-snapshot
Deciding determinism of caterpillar expressions
inferred← citeshttps://doi.org/10.1145/2213556.2213566openalex-snapshot
Deterministic regular expressions in linear time
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.