On the public citation graph
Regular expressions into finite automata
0 signed · 24 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.1016/0304-3975(86)90088-5openalex-snapshot
From regular expressions to deterministic 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.1049/sqj.1969.0041openalex-snapshot
Finite-State Models for Logical Machines
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/321239.321249openalex-snapshot
Derivatives of 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.1007/3-540-55210-3_182openalex-snapshot
Deterministic regular languages
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_45openalex-snapshot
Unambiguity of extended regular expressions in SGML document grammars
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_54openalex-snapshot
Valuations and unambiguity of languages, with applications to fractal geometry
inferred← citeshttps://doi.org/10.1007/3-540-64359-1_709openalex-snapshot
Parallel algorithms for finite automata problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-3282-4_10openalex-snapshot
Parallel Algorithms for Finite Automata Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-71112-1_23openalex-snapshot
Benchmarking Regular Expression Matching
inferred← citeshttps://doi.org/10.1007/978-3-319-03602-1_13openalex-snapshot
Constraint-Based Automated Generation of Test Data
inferred← citeshttps://doi.org/10.1007/978-3-642-03466-4_15openalex-snapshot
Regular Expressions with Numerical Constraints and Automata with Counters
inferred← citeshttps://doi.org/10.1007/978-3-662-49498-1_2openalex-snapshot
Regular Programming for Quantitative Properties of Data Streams
inferred← citeshttps://doi.org/10.1007/bf01613617openalex-snapshot
Valuations, regular expressions, and fractal geometry
inferred← citeshttps://doi.org/10.1007/bfb0015253openalex-snapshot
Standard Generalized Markup Language: Mathematical and philosophical issues
inferred← citeshttps://doi.org/10.1007/s00224-012-9428-xopenalex-snapshot
Generating, Sampling and Counting Subclasses of Regular Tree Languages
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00104-2openalex-snapshot
Local languages and the Berry-Sethi algorithm
inferred← citeshttps://doi.org/10.1109/iciscon.2013.6524162openalex-snapshot
An algorithm to design finite automata that accept strings over input symbol a and b having exactly x number of a & y number of b
inferred← citeshttps://doi.org/10.1145/1938551.1938559openalex-snapshot
Generating, sampling and counting subclasses of regular tree languages
inferred← citeshttps://doi.org/10.2197/ipsjdc.2.248openalex-snapshot
Pattern Matching of Incompletely RE-Typed Expressions via Transformation
inferred← citeshttps://doi.org/10.4242/balisagevol15.sperberg-mcqueen01openalex-snapshot
Tricolor 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.