On the public citation graph

Congruences for Visibly Pushdown Languages

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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/10722468openalex-snapshot
SPIN Model Checking and Software Verification: 7th International SPIN Workshop Stanford, CA, USA, August 30 - September 1, 2000 Proceedings
inferredcites →https://doi.org/10.1007/10722468_7openalex-snapshot
Bebop: A Symbolic Model Checker for Boolean Programs
inferredcites →https://doi.org/10.1007/11523468_89openalex-snapshot
Congruences for Visibly Pushdown Languages
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_35openalex-snapshot
A Temporal Logic of Nested Calls and Returns
inferredcites →https://doi.org/10.1007/978-3-540-30538-5_2openalex-snapshot
Verifying Probabilistic Procedural Programs
inferredcites →https://doi.org/10.1007/978-3-540-30538-5_34openalex-snapshot
Visibly Pushdown Games
inferredcites →https://doi.org/10.1007/978-3-540-31982-5_13openalex-snapshot
Third-Order Idealized Algol with Iteration Is Decidable
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/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/b978-0-12-417750-5.50022-1openalex-snapshot
AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON
inferredcites →https://doi.org/10.1090/s0002-9939-1958-0135681-9openalex-snapshot
Linear Automaton Transformations
inferredcites →https://doi.org/10.1145/1007352.1007390openalex-snapshot
Visibly pushdown languages
inferredcites →https://doi.org/10.1145/1075382.1075387openalex-snapshot
Analysis of recursive state machines

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11539452_2openalex-snapshot
The Benefits of Exposing Calls and Returns
inferred← citeshttps://doi.org/10.1007/11672142_34openalex-snapshot
Regularity Problems for Visibly Pushdown Languages
inferred← citeshttps://doi.org/10.1007/11779148_1openalex-snapshot
Adding Nesting Structure to Words
inferred← citeshttps://doi.org/10.1007/11817949_14openalex-snapshot
Minimization, Learning, and Conformance Testing of Boolean Programs
inferred← citeshttps://doi.org/10.1007/11874683_6openalex-snapshot
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
inferred← citeshttps://doi.org/10.1007/11901914_10openalex-snapshot
On the Membership Problem for Visibly Pushdown Languages
inferred← citeshttps://doi.org/10.1007/978-3-030-00244-2_10openalex-snapshot
Active Mining of Document Type Definitions
inferred← citeshttps://doi.org/10.1007/978-3-030-50026-9_12openalex-snapshot
Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-87348-6_10openalex-snapshot
A Context-Free Symbiosis of Runtime Verification and Automata Learning
inferred← citeshttps://doi.org/10.1007/978-3-030-91384-7_9openalex-snapshot
Never-Stop Context-Free Learning
inferred← citeshttps://doi.org/10.1007/978-3-031-15629-8_11openalex-snapshot
From Languages to Behaviors and Back
inferred← citeshttps://doi.org/10.1007/978-3-031-15629-8_5openalex-snapshot
A Survey of Model Learning Techniques for Recurrent Neural Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-30823-9_14openalex-snapshot
Validating Streaming JSON Documents with Learned VPAs
inferred← citeshttps://doi.org/10.1007/978-3-031-66159-4_11openalex-snapshot
The Pumping Lemma for Context-Free Languages is Undecidable
inferred← citeshttps://doi.org/10.1007/978-3-031-97100-6_8openalex-snapshot
On the Decidability and Expressive Power of Several Theories Based on String Constraints
inferred← citeshttps://doi.org/10.1007/978-3-032-11176-0_15openalex-snapshot
A Variety of Request-Response Specifications
inferred← citeshttps://doi.org/10.1007/978-3-032-28404-4_15openalex-snapshot
Visibly Recursive Automata
inferred← citeshttps://doi.org/10.1007/978-3-032-28404-4_8openalex-snapshot
Visibly Pushdown Languages in Groups
inferred← citeshttps://doi.org/10.1007/978-3-540-69850-0_6openalex-snapshot
Model Checking: From Tools to Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_19openalex-snapshot
Weighted Logics for Nested Words and Algebraic Formal Power Series
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_41openalex-snapshot
Arithmetizing Classes Around NC 1 and L
inferred← citeshttps://doi.org/10.1007/978-3-540-71389-0_13openalex-snapshot
Tree Automata with Memory, Visibility and Structural Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_13openalex-snapshot
Height-Deterministic Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_14openalex-snapshot
Minimizing Variants of Visibly Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-77684-0_16openalex-snapshot
Visibly Pushdown Transducers for Approximate Validation of Streaming XML
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_5openalex-snapshot
State Complexity of Nested Word Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-21254-3_28openalex-snapshot
Normalization of Sequential Top-Down Tree-to-Word Transducers
inferred← citeshttps://doi.org/10.1007/978-3-642-21254-3_33openalex-snapshot
Descriptional Complexity of Unambiguous Nested Word Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_44openalex-snapshot
State Complexity of Operations on Input-Driven Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_41openalex-snapshot
Secure Programming via Visibly Pushdown Safety Games
inferred← citeshttps://doi.org/10.1007/978-3-642-31644-9_13openalex-snapshot
Descriptional Complexity of Input-Driven Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-31644-9_9openalex-snapshot
The Boolean Formula Value Problem as Formal Language
inferred← citeshttps://doi.org/10.1007/978-3-642-31653-1_17openalex-snapshot
Dense Completeness
inferred← citeshttps://doi.org/10.1007/978-3-642-39274-0_9openalex-snapshot
Trimming Visibly Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-54577-5_27openalex-snapshot
Minimization of Visibly Pushdown Automata Using Partial Max-SAT
inferred← citeshttps://doi.org/10.1007/s00224-009-9233-3openalex-snapshot
Arithmetizing Classes Around $\textsf{NC}$ 1 and $\textsf{L}$
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.1007/s00236-013-0190-6openalex-snapshot
Visibly rational expressions
inferred← citeshttps://doi.org/10.1007/s10009-021-00634-yopenalex-snapshot
Compositional learning of mutually recursive procedural systems
inferred← citeshttps://doi.org/10.1007/s10703-007-0040-7openalex-snapshot
The word problem for visibly pushdown languages described by grammars
inferred← citeshttps://doi.org/10.1016/j.cl.2016.07.005openalex-snapshot
Efficient determinization of visibly and height-deterministic pushdown automata
inferred← citeshttps://doi.org/10.1016/j.ic.2010.11.021openalex-snapshot
Limitations of lower bound methods for deterministic nested word automata
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.02.001openalex-snapshot
State complexity of operations on input-driven pushdown automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.01.004openalex-snapshot
Nondeterministic state complexity of nested word automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.05.002openalex-snapshot
Operational state complexity of nested word automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.11.015openalex-snapshot
Descriptional complexity of unambiguous input-driven pushdown automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.018openalex-snapshot
Trimming visibly pushdown automata
inferred← citeshttps://doi.org/10.1109/sice.2007.4421040openalex-snapshot
Application of DES theory to verification of software components
inferred← citeshttps://doi.org/10.1142/9789814271059_0019openalex-snapshot
Syntax Directed Compression of Trees Using Pushdown Automata
inferred← citeshttps://doi.org/10.1145/1007352.1007390openalex-snapshot
Visibly pushdown languages
inferred← citeshttps://doi.org/10.1145/1242572.1242714openalex-snapshot
Visibly pushdown automata for streaming XML
inferred← citeshttps://doi.org/10.1145/1265530.1265564openalex-snapshot
Marrying words and trees
inferred← citeshttps://doi.org/10.1145/1516512.1516518openalex-snapshot
Adding nesting structure to words
inferred← citeshttps://doi.org/10.1145/2636805.2636821openalex-snapshot
Complexity of input-driven pushdown automata
inferred← citeshttps://doi.org/10.1145/3571203openalex-snapshot
On the Expressive Power of String Constraints
inferred← citeshttps://doi.org/10.1145/3656458openalex-snapshot
V-Star: Learning Visibly Pushdown Grammars from Program Inputs
inferred← citeshttps://doi.org/10.1145/3689760openalex-snapshot
Weighted Context-Free-Language Ordered Binary Decision Diagrams
inferred← citeshttps://doi.org/10.14778/3778092.3778109openalex-snapshot
Streaming Validation of JSON Documents against Schemas
inferred← citeshttps://doi.org/10.15439/2015f325openalex-snapshot
A New Algorithm for the Determinisation of Visibly Pushdown Automata
inferred← citeshttps://doi.org/10.1587/transfun.e92.a.604openalex-snapshot
Application of DES Theory to Verification of Software Components
inferred← citeshttps://doi.org/10.2168/lmcs-5(1:2)2009openalex-snapshot
Beyond Language Equivalence on Visibly Pushdown Automata
inferred← citeshttps://doi.org/10.2168/lmcs-6(1:5)2010openalex-snapshot
Weighted Logics for Nested Words and Algebraic Formal Power Series
inferred← citeshttps://doi.org/10.23638/lmcs-16(1:14)2020openalex-snapshot
Minimization of visibly pushdown automata is NP-complete
inferred← citeshttps://doi.org/10.3390/a14030068openalex-snapshot
Determinization and Minimization of Automata for Nested Words Revisited
inferred← citeshttps://doi.org/10.70675/1c02061eze223z4fbfzb6fdzf9a2f187469dopenalex-snapshot
Certain query answering on hyperstreams
inferred← citeshttps://doi.org/10.70675/4b2e3e72z109ez4187zaf03z0371e6c18af0openalex-snapshot
Verification of Infinite-State Systems and Machine Learning
inferred← citeshttps://doi.org/10.7146/brics.v13i13.21918openalex-snapshot
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
showing the first 67 of 68 · page through all 68
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.