On the public citation graph
Co-lexicographically Ordering Automata and Regular Languages - Part I
0 signed · 81 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-44693-1_28openalex-snapshot
Efficient Minimal Perfect Hashing in Nearly Minimal Space
inferredcites →https://doi.org/10.1007/3-540-46011-x_20openalex-snapshot
Partially-Ordered Two-Way Automata: A New Characterization of DA
inferredcites →https://doi.org/10.1007/3-540-48340-3_4openalex-snapshot
The Burrows-Wheeler Transform: Theory and Practice
inferredcites →https://doi.org/10.1007/978-3-030-59212-7_6openalex-snapshot
An Efficient Elastic-Degenerate Text Index? Not Likely
inferredcites →https://doi.org/10.1007/978-3-030-67731-2_44openalex-snapshot
Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails
inferredcites →https://doi.org/10.1007/978-3-030-68195-1_5openalex-snapshot
Succinct Representations for (Non)Deterministic Finite Automata
inferredcites →https://doi.org/10.1007/978-3-031-43980-3_6openalex-snapshot
Optimal Wheeler Language Recognition
inferredcites →https://doi.org/10.1007/978-3-540-75530-2_11openalex-snapshot
A Fast and Compact Web Graph Representation
inferredcites →https://doi.org/10.1007/978-3-642-02927-1_16openalex-snapshot
Faster Regular Expression Matching
inferredcites →https://doi.org/10.1007/978-3-642-03784-9_3openalex-snapshot
k2-Trees for Compact Web Graph Representation
inferredcites →https://doi.org/10.1007/978-3-642-13509-5_13openalex-snapshot
Succinct Representations of Separable Graphs
inferredcites →https://doi.org/10.1007/978-3-642-33122-0_18openalex-snapshot
Succinct de Bruijn Graphs
inferredcites →https://doi.org/10.1007/978-3-642-59126-6_3openalex-snapshot
Context-Free Graph Grammars
inferredcites →https://doi.org/10.1007/978-3-662-07003-1openalex-snapshot
Elements of Finite Model Theory
inferredcites →https://doi.org/10.1007/s00453-012-9712-9openalex-snapshot
Compact Navigation and Distance Oracles for Graphs with Small Treewidth
inferredcites →https://doi.org/10.1007/s00453-017-0365-6openalex-snapshot
Compact Representation of Graphs of Small Clique-Width
inferredcites →https://doi.org/10.1007/s00453-021-00917-5openalex-snapshot
On the Complexity of Recognizing Wheeler Graphs
inferredcites →https://doi.org/10.1007/s00453-022-00989-xopenalex-snapshot
Solving String Problems on Graphs Using the Labeled Direct Product
inferredcites →https://doi.org/10.1016/0022-0000(80)90003-3openalex-snapshot
Languages of R-trivial monoids
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(81)90036-0openalex-snapshot
A generalization of the Schützenberger product of finite monoids
inferredcites →https://doi.org/10.1016/0304-3975(81)90057-8openalex-snapshot
Classification of finite monoids: the language approach
inferredcites →https://doi.org/10.1016/j.comgeo.2020.101630openalex-snapshot
Fast and compact planar embeddings
inferredcites →https://doi.org/10.1016/j.ic.2022.104867openalex-snapshot
Compact representation of graphs with bounded bandwidth or treedepth
inferredcites →https://doi.org/10.1016/j.ipl.2020.105993openalex-snapshot
Lengths of words accepted by nondeterministic finite automata
inferredcites →https://doi.org/10.1016/j.jcss.2011.09.002openalex-snapshot
Ultra-succinct representation of ordered trees with applications
inferredcites →https://doi.org/10.1016/j.tcs.2007.07.014openalex-snapshot
An extension of the Burrows–Wheeler Transform
inferredcites →https://doi.org/10.1016/j.tcs.2009.05.019openalex-snapshot
Determination of finite automata accepting subregular languages
inferredcites →https://doi.org/10.1016/j.tcs.2017.06.016openalex-snapshot
Wheeler graphs: A framework for BWT-based data structures
inferredcites →https://doi.org/10.1016/j.tcs.2022.11.010openalex-snapshot
Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number
inferredcites →https://doi.org/10.1016/j.tcs.2023.113709openalex-snapshot
Ordering regular languages and automata: Complexity
inferredcites →https://doi.org/10.1016/s0019-9958(65)90108-7openalex-snapshot
On finite monoids having only trivial subgroups
inferredcites →https://doi.org/10.1093/bioinformatics/btv603openalex-snapshot
Graphical pan-genome analysis with compressed suffix trees and the Burrows–Wheeler transform
inferredcites →https://doi.org/10.1109/comst.2016.2566669openalex-snapshot
A Survey on Regular Expression Matching for Deep Packet Inspection: Applications, Algorithms, and Hardware Platforms
inferredcites →https://doi.org/10.1109/dcc.2016.70openalex-snapshot
Linear Time Succinct Indexable Dictionary Construction with Applications
inferredcites →https://doi.org/10.1109/dcc52660.2022.00013openalex-snapshot
Linear-time Minimization of Wheeler DFAs
inferredcites →https://doi.org/10.1109/dcc52660.2022.00035openalex-snapshot
Graphs can be succinctly indexed for pattern matching in $O(\vert E\vert ^{2}+\vert V\vert ^{5/2})$ time
inferredcites →https://doi.org/10.1109/focs.2015.15openalex-snapshot
Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping
inferredcites →https://doi.org/10.1109/focs.2016.56openalex-snapshot
Which Regular Expression Patterns Are Hard to Match?
inferredcites →https://doi.org/10.1109/focs.2017.36openalex-snapshot
A Dichotomy for Regular Expression Membership Testing
inferredcites →https://doi.org/10.1109/focs52979.2021.00059openalex-snapshot
Faster Sparse Minimum Cost Flow by Electrical Flow Localization
inferredcites →https://doi.org/10.1109/sfcs.2000.892127openalex-snapshot
Opportunistic data structures with applications
inferredcites →https://doi.org/10.1109/sfcs.2005.69openalex-snapshot
Structuring labeled trees for optimal succinctness, and beyond
inferredcites →https://doi.org/10.1109/tcbb.2013.2297101openalex-snapshot
Indexing Graphs for Path Queries with Applications in Genome Research
inferredcites →https://doi.org/10.1109/tse.1981.234528openalex-snapshot
8th International Colloquium on Automata, Languages and Programming (ICALP 81)
inferredcites →https://doi.org/10.1137/1.9781611975994.55openalex-snapshot
Regular Languages meet Prefix Sorting
inferredcites →https://doi.org/10.1137/1.9781611976465.153openalex-snapshot
On Indexing and Compressing Finite Automata
inferredcites →https://doi.org/10.1137/1.9781611976465.47openalex-snapshot
On Locating Paths in Compressed Tries
inferredcites →https://doi.org/10.1137/1.9781611976496.26openalex-snapshot
Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism
inferredcites →https://doi.org/10.1145/1322432.1322433openalex-snapshot
Survey of graph database models
inferredcites →https://doi.org/10.1145/2629339openalex-snapshot
Optimal Lower and Upper Bounds for Representing Sequences
inferredcites →https://doi.org/10.1145/321495.321505openalex-snapshot
On Decompositions of Regular Events
inferredcites →https://doi.org/10.1145/3375890openalex-snapshot
Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
inferredcites →https://doi.org/10.1145/38714.38749openalex-snapshot
A graphical query language supporting recursion
inferredcites →https://doi.org/10.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)
inferredcites →https://doi.org/10.1307/mmj/1028998975openalex-snapshot
Transition graphs and the star-height of regular events.
inferredcites →https://doi.org/10.2307/1969503openalex-snapshot
A Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.23638/lmcs-15(4:10)2019openalex-snapshot
Computing the Width of Non-deterministic Automata
inferredcites →https://doi.org/10.23638/lmcs-17(2:14)2021openalex-snapshot
Partially Ordered Automata and Piecewise Testability
inferredcites →https://doi.org/10.3390/a14050133openalex-snapshot
Text Indexing for Regular Expression Matching
inferredcites →https://doi.org/10.4230/lipics.esa.2020.15openalex-snapshot
On the Complexity of BWT-Runs Minimization via Alphabet Reordering
inferredcites →https://doi.org/10.4230/lipics.icalp.2019.55openalex-snapshot
On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree
inferredcites →https://doi.org/10.4230/lipics.swat.2022.33openalex-snapshot
Space-Efficient Data Structure for Posets with Applications
inferredcites →https://doi.org/10.4230/lipics.wabi.2023.10openalex-snapshot
Finding Maximal Exact Matches in Graphs
inferredcites →https://doi.org/10.5555/21559.21563openalex-snapshot
Finite automata and unary languages
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-031-43980-3_12openalex-snapshot
Space-Time Trade-Offs for the LCP Array of Wheeler DFAs
inferred← citeshttps://doi.org/10.1007/978-3-031-43980-3_6openalex-snapshot
Optimal Wheeler Language Recognition
inferred← citeshttps://doi.org/10.1007/978-3-031-98740-3_18openalex-snapshot
Fast Pattern Matching with Epsilon Transitions
inferred← citeshttps://doi.org/10.1007/978-3-032-01475-7_20openalex-snapshot
Sorting Circular Suffixes in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-032-01475-7_4openalex-snapshot
Universally Wheeler Languages
inferred← citeshttps://doi.org/10.1007/978-3-032-23456-8_20openalex-snapshot
On the Decision Problem of a Class of Automata Used for Security Verification of Network Protocols
inferred← citeshttps://doi.org/10.1007/978-3-032-28404-4_7openalex-snapshot
Generalized Wheeler Automata: Minimality
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103759openalex-snapshot
On the complexity of computing the co-lexicographic width of a regular language
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114754openalex-snapshot
Cascade products and Wheeler automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115631openalex-snapshot
Completing Wheeler Automata
inferred← citeshttps://doi.org/10.1093/nargab/lqae159openalex-snapshot
GIN-TONIC: non-hierarchical full-text indexing for graph genomes
inferred← citeshttps://doi.org/10.2139/ssrn.6926513openalex-snapshot
Ordering and Locally Testable Languages: a Wheeler Perspective
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.