On the public citation graph
The Language, the Expression, and the (Small) Automaton
0 signed · 41 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.1007/3-540-44674-5_5openalex-snapshot
Glushkov Construction for Multiplicities
inferredcites →https://doi.org/10.1007/3-540-45452-7_23openalex-snapshot
Constructing NFAs by Optimal Use of Positions in Regular Expressions
inferredcites →https://doi.org/10.1007/978-3-540-30500-2_31openalex-snapshot
Approximation to the Smallest Regular Expression for a Given Regular Language
inferredcites →https://doi.org/10.1007/978-3-540-30500-2_9openalex-snapshot
Computing the Follow Automaton of an Expression
inferredcites →https://doi.org/10.1007/978-3-663-09367-1openalex-snapshot
Transductions and Context-Free Languages
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/0304-3975(86)90088-5openalex-snapshot
From regular expressions to deterministic automata
inferredcites →https://doi.org/10.1016/0304-3975(91)90395-iopenalex-snapshot
Complete systems ofB-rational identities
inferredcites →https://doi.org/10.1016/0304-3975(93)90287-4openalex-snapshot
Regular expressions into finite automata
inferredcites →https://doi.org/10.1016/0304-3975(95)00104-2openalex-snapshot
Local languages and the Berry-Sethi algorithm
inferredcites →https://doi.org/10.1016/0304-3975(95)00182-4openalex-snapshot
Partial derivatives of regular expressions and finite automaton constructions
inferredcites →https://doi.org/10.1016/j.tcs.2004.10.016openalex-snapshot
Derivatives of rational expressions with multiplicity
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, and Machines
inferredcites →https://doi.org/10.1016/s0304-3975(01)00267-5openalex-snapshot
Canonical derivatives, partial derivatives and finite automaton constructions
inferredcites →https://doi.org/10.1016/s0304-3975(97)00296-xopenalex-snapshot
Characterization of Glushkov automata
inferredcites →https://doi.org/10.1051/ita:2000116openalex-snapshot
Computingϵ-Free NFA from Regular Expressions inO(nlog2(n)) Time
inferredcites →https://doi.org/10.1051/ita:2005013openalex-snapshot
How expressions can code for automata
inferredcites →https://doi.org/10.1070/rm1961v016n05abeh004112openalex-snapshot
THE ABSTRACT THEORY OF AUTOMATA
inferredcites →https://doi.org/10.1109/pgec.1963.263416openalex-snapshot
Signal Flow Graph Techniques for Sequential Circuit State Diagrams
inferredcites →https://doi.org/10.1109/tec.1960.5221603openalex-snapshot
Regular Expressions and State Graphs for Automata
inferredcites →https://doi.org/10.1145/321239.321249openalex-snapshot
Derivatives of Regular Expressions
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/978-3-540-70583-3_4openalex-snapshot
Finite Automata, Digraph Connectivity, and Regular Expression Size
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_39openalex-snapshot
Construction of Tree Automata from Regular Expressions
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_57openalex-snapshot
A New Family of Regular Operators Fitting with the Position Automaton Computation
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-02979-0_22openalex-snapshot
Short Regular Expressions from Finite Automata: Empirical Results
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-22321-1_23openalex-snapshot
Chop Operations and Expressions: Descriptional Complexity Considerations
inferred← citeshttps://doi.org/10.1007/s10703-023-00442-xopenalex-snapshot
Parameter synthesis for Markov models: covering the parameter space
inferred← citeshttps://doi.org/10.1051/ita/2011107openalex-snapshot
Construction of tree automata from regular expressions
inferred← citeshttps://doi.org/10.18154/rwth-2020-02348openalex-snapshot
Parameter synthesis in Markov models
inferred← citeshttps://doi.org/10.3233/fi-2009-0061openalex-snapshot
Series-Parallel Automata and Short Regular Expressions
inferred← citeshttps://doi.org/10.4171/automata-1/2openalex-snapshot
Automata and rational expressions
inferred← citeshttps://doi.org/10.4204/eptcs.31.16openalex-snapshot
State Elimination Ordering Strategies: Some Experimental Results
inferred← citeshttps://doi.org/10.48550/arxiv.1501.07686openalex-snapshot
Construction of rational expression from tree automata using a generalization of Arden's Lemma
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.