On the public citation graph
Regular canonical systems
0 signed · 123 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.1002/malq.19600060105openalex-snapshot
Weak Second‐Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1145/320924.320931openalex-snapshot
Realization of Events by Logical Nets
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems
inferredcites →https://doi.org/10.1515/9781400882618-002openalex-snapshot
Representation of Events in Nerve Nets and Finite Automata
inferredcites →https://doi.org/10.2307/2267170openalex-snapshot
Recursive Unsolvability of a problem of Thue
inferredcites →https://doi.org/10.2307/2371809openalex-snapshot
Formal Reductions of the General Combinatorial Decision Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1998.2786openalex-snapshot
Derivation Trees of Ground Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/1-4020-8141-3_39openalex-snapshot
Highly Undecidable Questions for Process Algebras
inferred← citeshttps://doi.org/10.1007/11549345_16openalex-snapshot
Regular Sets of Higher-Order Pushdown Stacks
inferred← citeshttps://doi.org/10.1007/11672142_34openalex-snapshot
Regularity Problems for Visibly Pushdown Languages
inferred← citeshttps://doi.org/10.1007/11787006_40openalex-snapshot
Communication of Two Stacks and Rewriting
inferred← citeshttps://doi.org/10.1007/11805618_11openalex-snapshot
Rewriting Models of Boolean Programs
inferred← citeshttps://doi.org/10.1007/11901914_31openalex-snapshot
Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
inferred← citeshttps://doi.org/10.1007/3-540-07407-4_29openalex-snapshot
Welcher Art Ergebnisse erwartet der Compilerbau von der Theoretischen Informatik?
inferred← citeshttps://doi.org/10.1007/3-540-09541-1_38openalex-snapshot
On a theory of decision problems in programming languages
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_108openalex-snapshot
Aspects of programs with finite modes
inferred← citeshttps://doi.org/10.1007/3-540-18170-9_178openalex-snapshot
Grammars for terms and automata
inferred← citeshttps://doi.org/10.1007/3-540-45007-6_27openalex-snapshot
Deleting String Rewriting Systems Preserve Regularity
inferred← citeshttps://doi.org/10.1007/3-540-45687-2_14openalex-snapshot
A Chomsky-Like Hierarchy of Infinite Graphs
inferred← citeshttps://doi.org/10.1007/3-540-46011-x_10openalex-snapshot
A Short Introduction to Infinite Automata
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_4openalex-snapshot
On Word Rewriting Systems Having a Rational Derivation
inferred← citeshttps://doi.org/10.1007/3-540-52590-4_42openalex-snapshot
On the regular structure of prefix rewriting
inferred← citeshttps://doi.org/10.1007/3-540-56287-7_115openalex-snapshot
Branching bisimulation for context-free processes
inferred← citeshttps://doi.org/10.1007/3-540-59340-3_7openalex-snapshot
Formal languages & word-rewriting
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_128openalex-snapshot
On infinite transition graphs having a decidable monadic theory
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_59openalex-snapshot
Bisimulation collapse and the process taxonomy
inferred← citeshttps://doi.org/10.1007/978-0-8176-4769-8_13openalex-snapshot
The Work of J. Richard Büchi
inferred← citeshttps://doi.org/10.1007/978-1-4613-8928-6_21openalex-snapshot
Canonical Systems which Produce Periodic Sets
inferred← citeshttps://doi.org/10.1007/978-3-030-40608-0_5openalex-snapshot
How to Prove that a Language Is Regular or Star-Free?
inferred← citeshttps://doi.org/10.1007/978-3-032-32592-1_11openalex-snapshot
A Unified Formalization of Context-Free Grammar Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-24537-9_11openalex-snapshot
Multithreaded-Cartesian Abstract Interpretation of Multithreaded Recursive Programs Is Polynomial
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_23openalex-snapshot
Extended Process Rewrite Systems: Expressiveness and Reachability
inferred← citeshttps://doi.org/10.1007/978-3-540-69507-3_2openalex-snapshot
Model-Checking Large Finite-State Systems and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-540-73370-6_10openalex-snapshot
SAT-Based Summarization for Boolean Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-77966-7_17openalex-snapshot
A Complete Bounded Model Checking Algorithm for Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_17openalex-snapshot
Positional Strategies for Higher-Order Pushdown Parity Games
inferred← citeshttps://doi.org/10.1007/978-3-540-88282-4_6openalex-snapshot
On Bifix Systems and Generalizations
inferred← citeshttps://doi.org/10.1007/978-3-642-04420-5_13openalex-snapshot
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
inferred← citeshttps://doi.org/10.1007/978-3-642-19805-2_15openalex-snapshot
Regularity and Context-Freeness over Word Rewriting Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-39310-5_10openalex-snapshot
A Direct Construction of Finite State Automata for Pushdown Store Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_7openalex-snapshot
Languages, Automata, and Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-76677-0_15openalex-snapshot
Büchis reguläre kanonische Systeme und Analyse kontextfreier Grammatiken
inferred← citeshttps://doi.org/10.1007/978-3-642-76677-0_25openalex-snapshot
Myhill-Büchis Teilmengenkonstruktion
inferred← citeshttps://doi.org/10.1007/978-3-662-48899-7_18openalex-snapshot
Synchronized Recursive Timed Automata
inferred← citeshttps://doi.org/10.1007/bf00263585openalex-snapshot
Recording the use of memory in right-boundary grammars and push-down automata
inferred← citeshttps://doi.org/10.1007/bf00263989openalex-snapshot
Methods for the automatic construction of error correcting parsers
inferred← citeshttps://doi.org/10.1007/bf00288636openalex-snapshot
On procedures as open subroutines. II
inferred← citeshttps://doi.org/10.1007/bf00289049openalex-snapshot
A unified approach to the generation and the acception of formal languages
inferred← citeshttps://doi.org/10.1007/bf00289518openalex-snapshot
Application of regular canonical systems to grammars translatable from left to right
inferred← citeshttps://doi.org/10.1007/bf00625282openalex-snapshot
On termination problems for finitely interpreted ALGOL-like programs
inferred← citeshttps://doi.org/10.1007/bf01703264openalex-snapshot
On regular expressions and regular canonical systems
inferred← citeshttps://doi.org/10.1007/bf01705888openalex-snapshot
Canonical systems which produce periodic sets
inferred← citeshttps://doi.org/10.1007/bf01768471openalex-snapshot
On jump-deterministic pushdown automata
inferred← citeshttps://doi.org/10.1007/bfb0017390openalex-snapshot
An application of graph grammars to the elimination of redundancy from functions defined by schemes
inferred← citeshttps://doi.org/10.1007/bfb0029988openalex-snapshot
Homomorphic images of sentential forms and terminating grammars (extended abstract)
inferred← citeshttps://doi.org/10.1007/bfb0031387openalex-snapshot
Towards a meta-normal form algorithm for context-free grammars
inferred← citeshttps://doi.org/10.1007/bfb0055615openalex-snapshot
The regular viewpoint on PA-processes
inferred← citeshttps://doi.org/10.1007/s10817-005-9015-9openalex-snapshot
Decidability Issues for Extended Ping-Pong Protocols
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90121-xopenalex-snapshot
Generalized parenthesis languages and minimization of their parenthesis parts
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90086-6openalex-snapshot
On coordinated selective substitutions: Towards a unified theory of grammars and machines
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90095-2openalex-snapshot
On the active and full use of memory in right-boundary grammars and push-down automata
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90278-nopenalex-snapshot
On the regular structure of prefix rewriting
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50008-1openalex-snapshot
Formal Languages and Power Series
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50027-8openalex-snapshot
Verification on Infinite Structures
inferred← citeshttps://doi.org/10.1016/j.ic.2009.01.003openalex-snapshot
Reachability is decidable for weakly extended process rewrite systems
inferred← citeshttps://doi.org/10.1016/j.ic.2009.07.001openalex-snapshot
Computational power of two stacks with restricted communication
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.04.009openalex-snapshot
Deleting string rewriting systems preserve regularity
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.10.017openalex-snapshot
Parallel communicating grammar systems with regular control and skeleton preserving FRR automata
inferred← citeshttps://doi.org/10.1016/s0019-9958(67)90369-5openalex-snapshot
Two-way pushdown automata
inferred← citeshttps://doi.org/10.1016/s0019-9958(69)90065-5openalex-snapshot
Tree generating regular systems
inferred← citeshttps://doi.org/10.1016/s0019-9958(75)80002-7openalex-snapshot
Erasable context-free languages
inferred← citeshttps://doi.org/10.1016/s0019-9958(75)90058-3openalex-snapshot
Generalizations of regular sets and their application to a study of context-free languages
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00055-7openalex-snapshot
An efficient automata approach to some problems on context-free grammars
inferred← citeshttps://doi.org/10.1016/s0022-0000(70)80017-4openalex-snapshot
Generalized2 sequential machine maps
inferred← citeshttps://doi.org/10.1016/s0022-0000(76)80040-2openalex-snapshot
Intercalation lemmas for tree transducer languages
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73076-7openalex-snapshot
A New Transformational Approach to Partial Correctness Proof Calculi for Algol 6 8-Like Programs with Finite Modes and Simple Sideeffects
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00306-6openalex-snapshot
The regular viewpoint on PA-processes
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00089-5openalex-snapshot
On infinite transition graphs having a decidable monadic theory
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00090-7openalex-snapshot
On the symbolic reduction of processes with cryptographic functions
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00655-2openalex-snapshot
On the transition graphs of turing machines
inferred← citeshttps://doi.org/10.1023/a:1015850228563openalex-snapshot
Checking Simple Properties of Transition Systems Defined by Thue Specifications
inferred← citeshttps://doi.org/10.1051/ita/1990240504891openalex-snapshot
Comparison of basic language generating devices (non-deterministic systems)
inferred← citeshttps://doi.org/10.1051/ita/2014001openalex-snapshot
On the classes of languages accepted by limited context restarting automata
inferred← citeshttps://doi.org/10.1051/ita:2005024openalex-snapshot
Complexity results for prefix grammars
inferred← citeshttps://doi.org/10.1080/00207168108803224openalex-snapshot
Pure grammars and pure languages†
inferred← citeshttps://doi.org/10.1090/s0002-9939-1967-0209086-1openalex-snapshot
A Note on Pushdown Store Automata and Regular Systems
inferred← citeshttps://doi.org/10.1109/infocom.2018.8486261openalex-snapshot
Polynomial-Time What-If Analysis for Prefix-Manipulating MPLS Networks
inferred← citeshttps://doi.org/10.1109/t-c.1973.223654openalex-snapshot
Tree Systems for Syntactic Pattern Recognition
inferred← citeshttps://doi.org/10.1134/s003744662603002xopenalex-snapshot
Object-Oriented Data via Prefix Rewriting. Part I: Overview and Main Results
inferred← citeshttps://doi.org/10.1145/1326554.1326559openalex-snapshot
Undecidability of bisimilarity by defender's forcing
inferred← citeshttps://doi.org/10.1145/1542476.1542500openalex-snapshot
Analyzing recursive programs using a fixed-point calculus
inferred← citeshttps://doi.org/10.1145/1543135.1542500openalex-snapshot
Analyzing recursive programs using a fixed-point calculus
inferred← citeshttps://doi.org/10.1145/2908080.2908119openalex-snapshot
Polymorphic type inference for machine code
inferred← citeshttps://doi.org/10.1145/2980983.2908119openalex-snapshot
Polymorphic type inference for machine code
inferred← citeshttps://doi.org/10.1145/3121408openalex-snapshot
The Complexity of Mean-Payoff Pushdown Games
inferred← citeshttps://doi.org/10.1145/325694.325730openalex-snapshot
Paths vs. trees in set-based program analysis
inferred← citeshttps://doi.org/10.1145/3373718.3394737openalex-snapshot
Good-for-games ω-Pushdown Automata
inferred← citeshttps://doi.org/10.1145/3434325openalex-snapshot
Context-bounded verification of liveness properties for multithreaded shared-memory programs
inferred← citeshttps://doi.org/10.1145/3756907.3756912openalex-snapshot
Formalizing Weighted Pushdown Systems in Isabelle/HOL
inferred← citeshttps://doi.org/10.3233/jcs-160549openalex-snapshot
Model-checking trace-based information flow properties for infinite-state systems
inferred← citeshttps://doi.org/10.4204/eptcs.129.24openalex-snapshot
Iterable Forward Reachability Analysis of Monitor-DPNs
inferred← citeshttps://doi.org/10.4204/eptcs.151.1openalex-snapshot
Saturation algorithms for model-checking pushdown systems
inferred← citeshttps://doi.org/10.46298/lmcs-18(1:3)2022openalex-snapshot
Good-for-games $\omega$-Pushdown Automata
inferred← citeshttps://doi.org/10.46298/lmcs-20(1:3)2024openalex-snapshot
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
inferred← citeshttps://doi.org/10.48550/arxiv.2305.10546openalex-snapshot
Games on Graphs: From Logic and Automata to Algorithms
inferred← citeshttps://doi.org/10.54337/aau588616986openalex-snapshot
Quantitative Verification and Synthesis of Resilient Networks
inferred← citeshttps://doi.org/10.70675/7c30d231z10a9z41cfza1c1z9538d82e5610openalex-snapshot
Grammaires de graphes et langages formels
inferred← citeshttps://doi.org/10.7146/brics.v10i47.21819openalex-snapshot
Recursive Ping-Pong Protocols
inferred← citeshttps://doi.org/10.7146/brics.v11i7.21832openalex-snapshot
On the Expressive Power of Extended Process Rewrite Systems
inferred← citeshttps://doi.org/10.7146/brics.v11i8.21833openalex-snapshot
Highly Undecidable Questions for Process Algebras
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.