On the public citation graph

Translating regular expressions into small ε-free nondeterministic finite automata

https://doi.org/10.1007/bfb0023448
0 signed · 40 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.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0304-3975(93)90287-4openalex-snapshot
Regular expressions into 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/s0022-0000(76)80034-7openalex-snapshot
Complexity measures for regular expressions
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.1109/tec.1960.5221603openalex-snapshot
Regular Expressions and State Graphs for Automata
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.1006/inco.2001.3069openalex-snapshot
Communication Complexity Method for Measuring Nondeterminism in Finite Automata
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/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_6openalex-snapshot
Implicit Structures to Implement NFA’s from Regular Expressions
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-45022-x_17openalex-snapshot
Measures of Nondeterminism in Finite Automata
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/3-540-48318-7_17openalex-snapshot
Fast Regular Expression Search
inferred← citeshttps://doi.org/10.1007/3-540-63141-0_4openalex-snapshot
A product version of dynamic linear time temporal logic
inferred← citeshttps://doi.org/10.1007/978-3-031-30829-1_19openalex-snapshot
Fast Matching of Regular Patterns with Synchronizing Counting
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-540-75292-9_20openalex-snapshot
Regular Linear Temporal Logic
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.1007/978-3-642-32891-6_19openalex-snapshot
Dynamic Logic for the Semantic Web
inferred← citeshttps://doi.org/10.1007/bfb0031389openalex-snapshot
An efficient null-free procedure for deciding regular language membership
inferred← citeshttps://doi.org/10.1007/bfb0055777openalex-snapshot
Computing ε-free NFA from regular expressions in O(n log2(N)) time
inferred← citeshttps://doi.org/10.1007/s00224-012-9409-0openalex-snapshot
Series Parallel Digraphs with Loops
inferred← citeshttps://doi.org/10.1007/s10472-006-9020-7openalex-snapshot
Tableau-based automata construction for dynamic linear time temporal logic*
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00436-2openalex-snapshot
A lower bound on the size of ε-free NFA corresponding to a regular expression
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00036-9openalex-snapshot
Translation of binary regular expressions into nondeterministic ε-free automata with O(nlogn) transitions
inferred← citeshttps://doi.org/10.1051/ita:2000116openalex-snapshot
Computingϵ-Free NFA from Regular Expressions inO(nlog2(n)) Time
inferred← citeshttps://doi.org/10.1089/106652703322756140openalex-snapshot
Fast and Simple Character Classes and Bounded Gaps Pattern Matching, with Applications to Protein Searching
inferred← citeshttps://doi.org/10.1109/csfw.2002.1021822openalex-snapshot
A logic for reasoning about digital rights
inferred← citeshttps://doi.org/10.1109/time.2004.1314430openalex-snapshot
On-the-fly automata construction for dynamic linear time temporal logic
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/1559795.1559833openalex-snapshot
Distributed XML design
inferred← citeshttps://doi.org/10.1145/369133.369220openalex-snapshot
Fast and simple character classes and bounded gaps pattern matching, with application to protein searching
inferred← citeshttps://doi.org/10.4204/eptcs.3.6openalex-snapshot
Mutation of Directed Graphs -- Corresponding Regular Expressions and Complexity of Their Generation
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.