On the public citation graph
Graph Logics with Rational Relations
0 signed · 43 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.1805openalex-snapshot
Rewriting of Regular Expressions and Regular Path Queries
inferredcites →https://doi.org/10.1007/3-540-55124-7_4openalex-snapshot
Makanin's algorithm for word equations-two improvements and a generalization
inferredcites →https://doi.org/10.1007/978-3-540-28644-8_3openalex-snapshot
A Survey of Regular Model Checking
inferredcites →https://doi.org/10.1007/978-3-642-12032-9_16openalex-snapshot
Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems
inferredcites →https://doi.org/10.1007/978-3-642-31265-6_11openalex-snapshot
Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths
inferredcites →https://doi.org/10.1007/978-3-642-59207-2openalex-snapshot
The Classical Decision Problem
inferredcites →https://doi.org/10.1007/978-3-663-09367-1openalex-snapshot
Transductions and Context-Free Languages
inferredcites →https://doi.org/10.1016/0021-8693(69)90107-0openalex-snapshot
Sets recognized by n-tape automata
inferredcites →https://doi.org/10.1016/0304-3975(93)90230-qopenalex-snapshot
Synchronized rational relations of finite and infinite words
inferredcites →https://doi.org/10.1016/j.ic.2005.04.002openalex-snapshot
The existential theory of equations with rational constraints in free groups is PSPACE-complete
inferredcites →https://doi.org/10.1017/cbo9780511574931openalex-snapshot
Algorithms on Strings, Trees and Sequences
inferredcites →https://doi.org/10.1070/sm1977v032n02abeh002376openalex-snapshot
THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
inferredcites →https://doi.org/10.1109/lics.2015.39openalex-snapshot
Path Logics for Querying Graphs: Combining Expressiveness and Efficiency
inferredcites →https://doi.org/10.1109/sfcs.1977.16openalex-snapshot
Lower bounds for natural proof systems
inferredcites →https://doi.org/10.1142/s0129054111009112openalex-snapshot
RELATIONAL STRING VERIFICATION USING MULTI-TRACK AUTOMATA
inferredcites →https://doi.org/10.1145/1322432.1322433openalex-snapshot
Survey of graph database models
inferredcites →https://doi.org/10.1145/2206869.2206879openalex-snapshot
Query languages for graph databases
inferredcites →https://doi.org/10.1145/2389241.2389250openalex-snapshot
Expressive Languages for Path Queries over Graph-Structured Data
inferredcites →https://doi.org/10.1145/303976.303996openalex-snapshot
Rewriting of regular expressions and regular path queries
inferredcites →https://doi.org/10.1145/322063.322075openalex-snapshot
The Complexity of Some Problems on Subsequences and Supersequences
inferredcites →https://doi.org/10.1145/337244.337255openalex-snapshot
The expressibility of languages and relations by word equations
inferredcites →https://doi.org/10.1145/38713.38749openalex-snapshot
A graphical query language supporting recursion
inferredcites →https://doi.org/10.1145/800070.802186openalex-snapshot
The complexity of relational query languages (Extended Abstract)
inferredcites →https://doi.org/10.1145/876638.876642openalex-snapshot
Definable relations and first-order query languages over strings
inferredcites →https://doi.org/10.1145/990308.990312openalex-snapshot
Satisfiability of word equations with constants is in PSPACE
inferredcites →https://doi.org/10.2168/lmcs-9(3:1)2013openalex-snapshot
Graph Logics with Rational Relations
inferredcites →https://doi.org/10.3233/fi-1999-381209openalex-snapshot
Subwords and Power-Free Words are not Expressible by Word Equations
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-95481-9_1openalex-snapshot
Foundations of Graph Path Query Languages
inferred← citeshttps://doi.org/10.1007/978-3-031-05578-2_2openalex-snapshot
Word Equations in the Context of String Solving
inferred← citeshttps://doi.org/10.1007/s00224-018-9874-1openalex-snapshot
A Logic for Document Spanners
inferred← citeshttps://doi.org/10.1007/s00224-023-10154-8openalex-snapshot
A Closer Look at the Expressive Power of Logics Based on Word Equations
inferred← citeshttps://doi.org/10.1016/j.is.2021.101816openalex-snapshot
Practical and comprehensive formalisms for modelling contemporary graph query languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.02.031openalex-snapshot
Institutions for navigational logics for graphical structures
inferred← citeshttps://doi.org/10.1145/3517804.3524167openalex-snapshot
When is the Evaluation of Extended CRPQ Tractable?
inferred← citeshttps://doi.org/10.1145/3571203openalex-snapshot
On the Expressive Power of String Constraints
inferred← citeshttps://doi.org/10.1145/3622872openalex-snapshot
Solving String Constraints with Lengths by Stabilization
inferred← citeshttps://doi.org/10.1145/3802033openalex-snapshot
cuRPQ: A High-Performance GPU-Based Framework for Processing Regular and Conjunctive Regular Path Queries
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.