On the public citation graph
A Unified Construction of the Glushkov, Follow, and Antimirov Automata
0 signed · 65 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.1007/3-540-45089-0_6openalex-snapshot
From Regular Weighted Expressions to Finite Automata
inferredcites →https://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
inferredcites →https://doi.org/10.1007/3-540-48318-7_17openalex-snapshot
Fast Regular Expression Search
inferredcites →https://doi.org/10.1007/3-540-63174-7_9openalex-snapshot
A new quadratic algorithm to convert a regular expression into an automaton
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.1016/0304-3975(77)90056-1openalex-snapshot
Algebraic structures for transitive closure
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/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/s0019-9958(61)80020-xopenalex-snapshot
On the definition of a family of automata
inferredcites →https://doi.org/10.1016/s0304-3975(96)00140-5openalex-snapshot
From regular expressions to DFA's using compressed NFA's
inferredcites →https://doi.org/10.1017/cbo9781316135228openalex-snapshot
Flexible Pattern Matching in Strings
inferredcites →https://doi.org/10.1070/rm1961v016n05abeh004112openalex-snapshot
THE ABSTRACT THEORY OF AUTOMATA
inferredcites →https://doi.org/10.1080/0020716021000038992openalex-snapshot
Glushkov Construction For Series: The Non Commutative Case
inferredcites →https://doi.org/10.1109/tec.1960.5221603openalex-snapshot
Regular Expressions and State Graphs for Automata
inferredcites →https://doi.org/10.1142/s0129054102000996openalex-snapshot
GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS
inferredcites →https://doi.org/10.1145/363095.363146openalex-snapshot
Protection in an information processing utility
inferredcites →https://doi.org/10.1145/363347.363387openalex-snapshot
Programming Techniques: Regular expression search algorithm
inferredcites →https://doi.org/10.25596/jalc-2002-321openalex-snapshot
Semiring Frameworks and Algorithms for Shortest-Distance 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-030-79416-3_12openalex-snapshot
Analysis of an Efficient Reduction Algorithm for Random Regular Expressions Based on Universality Detection
inferred← citeshttps://doi.org/10.1007/978-3-031-20624-5_23openalex-snapshot
The Net Automaton of a Rational Expression
inferred← citeshttps://doi.org/10.1007/978-3-319-22360-5_4openalex-snapshot
From Ambiguous Regular Expressions to Deterministic Parsing Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-40946-7_5openalex-snapshot
Derived-Term Automata of Multitape Rational Expressions
inferred← citeshttps://doi.org/10.1007/978-3-319-46750-4_20openalex-snapshot
Derived-Term Automata for Extended Weighted Rational Expressions
inferred← citeshttps://doi.org/10.1007/978-3-319-62809-7_9openalex-snapshot
On the Mother of All Automata: The Position Automaton
inferred← citeshttps://doi.org/10.1007/978-3-319-67729-3_10openalex-snapshot
Derived-Term Automata of Weighted Rational Expressions with Quotient Operators
inferred← citeshttps://doi.org/10.1007/978-3-540-70844-5_25openalex-snapshot
Finite Eilenberg Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-73208-2_16openalex-snapshot
An Efficient Computation of the Equation $\mathbb{K}$ -Automaton of a Regular $\mathbb{K}$ -Expression
inferred← citeshttps://doi.org/10.1007/978-3-540-74767-3_38openalex-snapshot
Distributed Multi-source Regular Path Queries
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-22185-9_16openalex-snapshot
Correction of Invalid XML Documents with Respect to Single Type Tree Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-30507-8_21openalex-snapshot
An Incremental Correction Algorithm for XML Documents and Single Type Tree Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-31606-7_4openalex-snapshot
Adding Pebbles to Weighted Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-47666-6_23openalex-snapshot
Nominal Kleene Coalgebra
inferred← citeshttps://doi.org/10.1007/978-981-96-8312-3_2openalex-snapshot
k-Universality of Regular Languages Revisited
inferred← citeshttps://doi.org/10.1007/s00236-020-00366-7openalex-snapshot
A deterministic parsing algorithm for ambiguous regular expressions
inferred← citeshttps://doi.org/10.1016/j.fss.2012.01.007openalex-snapshot
Construction of fuzzy automata from fuzzy regular expressions
inferred← citeshttps://doi.org/10.1016/j.ipl.2016.07.003openalex-snapshot
Compact representations of automata for regular expression matching
inferred← citeshttps://doi.org/10.1016/j.scico.2012.03.001openalex-snapshot
Jaccie : A Java-based compiler–compiler for generating, visualizing and debugging compiler components
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.09.061openalex-snapshot
Fault-tolerant computation of distributed regular path queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.10.019openalex-snapshot
Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.02.034openalex-snapshot
Adding pebbles to weighted automata: Easy specification & efficient evaluation
inferred← citeshttps://doi.org/10.1017/s0960129515000390openalex-snapshot
Computing with relational machines
inferred← citeshttps://doi.org/10.1093/comjnl/bxv104openalex-snapshot
Parallel Fuzzy Regular Expression and its Conversion to Epsilon-Free Fuzzy Automaton
inferred← citeshttps://doi.org/10.1142/s0218196713400146openalex-snapshot
THE VALIDITY OF WEIGHTED AUTOMATA
inferred← citeshttps://doi.org/10.1145/1863543.1863594openalex-snapshot
A play on regular expressions
inferred← citeshttps://doi.org/10.1145/1932681.1863594openalex-snapshot
A play on regular expressions
inferred← citeshttps://doi.org/10.1145/2370776.2370788openalex-snapshot
Regular expression sub-matching using partial derivatives
inferred← citeshttps://doi.org/10.1145/3428286openalex-snapshot
Regex matching with counting-set automata
inferred← citeshttps://doi.org/10.1145/3453483.3454066openalex-snapshot
Symbolic Boolean derivatives for efficiently solving extended regular expression constraints
inferred← citeshttps://doi.org/10.1162/coli_a_00309openalex-snapshot
Weighted DAG Automata for Semantic Graphs
inferred← citeshttps://doi.org/10.15514/ispras-2023-35(3)-8openalex-snapshot
REDoS Detection in “Domino” Regular Expressions by Ambiguity Analysis
inferred← citeshttps://doi.org/10.3233/fi-2009-0001openalex-snapshot
An Efficient Computation of the Equation K-automaton of a Regular K-expression
inferred← citeshttps://doi.org/10.3233/fun-2008-892-304openalex-snapshot
Preferential Regular Path Queries
inferred← citeshttps://doi.org/10.3390/a14080238openalex-snapshot
Efficient Construction of the Equation Automaton
inferred← citeshttps://doi.org/10.4171/automata-1/2openalex-snapshot
Automata and rational expressions
inferred← citeshttps://doi.org/10.47749/t/unicamp.2016.975469openalex-snapshot
Alinhamento de sequências restrito por expressão regular usando padrões PROSITE
inferred← citeshttps://doi.org/10.5176/2251-1911_cmcgs14.28openalex-snapshot
Counting Regular Expressions in Degenerated Sequences through Lazy Markov Chain Embedding
inferred← citeshttps://doi.org/10.5772/18448openalex-snapshot
Significance Score of Motifs in Biological Sequences
inferred← citeshttps://doi.org/10.70675/9ec2dc59zadb1z414fz949fz0fd1afaab001openalex-snapshot
Specification and verification of quantitative properties : expressions, logics, and automata
inferred← citeshttps://doi.org/10.70675/ce73a4f3z5be9z4ee8z96f8zeab6c61a4477openalex-snapshot
Systèmes de fonctions holonomes : application à la théorie des automates
inferred← citeshttps://doi.org/10.7561/sacs.2017.2.137openalex-snapshot
Derived-Term Automata of Multitape Expressions with Composition
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.