On the public citation graph
Mona & Fido: The logic-automaton connection in practice
0 signed · 98 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.1007/3-540-56922-7_3openalex-snapshot
Parametric circuit representation using inductive Boolean functions
inferredcites →https://doi.org/10.1007/3-540-60630-0_5openalex-snapshot
Mona: Monadic second-order logic in practice
inferredcites →https://doi.org/10.1007/3-540-61064-2_27openalex-snapshot
Diophantine equations, Presburger arithmetic and finite automata
inferredcites →https://doi.org/10.1007/3-540-63166-6_13openalex-snapshot
An n log n algorithm for online BDD refinement
inferredcites →https://doi.org/10.1007/3-540-63166-6_41openalex-snapshot
Symbolic model checking with rich assertional languages
inferredcites →https://doi.org/10.1007/3-540-63174-7_2openalex-snapshot
Algorithms for guided tree automata
inferredcites →https://doi.org/10.1007/3-540-63174-7_5openalex-snapshot
Implementing WS1S via finite automata
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_22openalex-snapshot
Weak Second-Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1007/bf01691346openalex-snapshot
Generalized finite automata theory with an application to a decision problem of second-order logic
inferredcites →https://doi.org/10.1007/bfb0022276openalex-snapshot
A homomorphism concept for ω-regularity
inferredcites →https://doi.org/10.1007/bfb0035388openalex-snapshot
Mosel: A flexible toolset for monadic second-order logic
inferredcites →https://doi.org/10.1007/bfb0064872openalex-snapshot
Weak monadic second order theory of succesor is not elementary-recursive
inferredcites →https://doi.org/10.1016/0304-3975(85)90148-3openalex-snapshot
A syntactic congruence for rational ω-languages
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferredcites →https://doi.org/10.1016/s0022-0000(70)80041-1openalex-snapshot
Tree acceptors and some of their applications
inferredcites →https://doi.org/10.1016/s0304-3975(96)00312-xopenalex-snapshot
On syntactic congruences for ω-languages
inferredcites →https://doi.org/10.1051/ita/1990240605451openalex-snapshot
Saturating right congruences
inferredcites →https://doi.org/10.1090/s0002-9904-1968-12122-6openalex-snapshot
Decidability of second-order theories and automata on infinite trees
inferredcites →https://doi.org/10.1090/s0002-9947-1961-0139530-9openalex-snapshot
Decision problems of finite automata design and related arithmetics
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0246760-1openalex-snapshot
Decidability of second-order theories and automata on infinite trees.
inferredcites →https://doi.org/10.1109/12.144618openalex-snapshot
On the OBDD-representation of general Boolean functions
inferredcites →https://doi.org/10.1109/32.798326openalex-snapshot
A domain-specific language for regular sets of strings and trees
inferredcites →https://doi.org/10.1109/iccad.1993.580055openalex-snapshot
Representation and symbolic manipulation of linearly inductive Boolean functions
inferredcites →https://doi.org/10.1142/s0218196793000287openalex-snapshot
AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
inferredcites →https://doi.org/10.1145/136035.136043openalex-snapshot
Symbolic Boolean manipulation with ordered binary-decision diagrams
inferredcites →https://doi.org/10.1145/258915.258936openalex-snapshot
Automatic verification of pointer programs using monadic second-order logic
inferredcites →https://doi.org/10.5555/259794.259827openalex-snapshot
Representation and symbolic manipulation of linearly inductive Boolean functions
inferredcites →https://doi.org/10.7146/brics.v1i11.21659openalex-snapshot
A Homomorphism Concept for omega-Regularity
inferredcites →https://doi.org/10.7146/brics.v2i21.19923openalex-snapshot
MONA: Monadic Second-Order Logic in Practice
inferredcites →https://doi.org/10.7146/brics.v2i7.19509openalex-snapshot
Hardware Verification using Monadic Second-Order Logic
inferredcites →https://doi.org/10.7146/brics.v3i26.20007openalex-snapshot
BDD Algortihms and Cache Misses
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1999.1013openalex-snapshot
An nlogn Algorithm for Online BDD Refinement
inferred← citeshttps://doi.org/10.1007/10722167_16openalex-snapshot
Decision Procedures for Inductive Boolean Functions Based on Alternating Automata
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_1openalex-snapshot
Branching vs. Linear Time: Final Showdown
inferred← citeshttps://doi.org/10.1007/3-540-45510-8_1openalex-snapshot
Model Checking: A Tutorial Overview
inferred← citeshttps://doi.org/10.1007/3-540-46425-5_8openalex-snapshot
Compile-Time Debugging of C Programs Working on Trees
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_35openalex-snapshot
A Theory of Restrictions for Logics and Automata
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_43openalex-snapshot
The Weakness of Self-Complementation
inferred← citeshttps://doi.org/10.1007/978-0-387-35533-7_2openalex-snapshot
Verification of a Sliding Window Protocol Using IOA and MONA
inferred← citeshttps://doi.org/10.1007/978-1-4614-1695-1_26openalex-snapshot
Decidable Containment Problems of Rational Word Relations
inferred← citeshttps://doi.org/10.1007/978-1-4615-0817-5_9openalex-snapshot
Optimization of Synchronous Circuits
inferred← citeshttps://doi.org/10.1007/978-3-031-40247-0_6openalex-snapshot
Universal First-Order Quantification over Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-43264-4_44openalex-snapshot
Efficient Algorithms for LTL$$_f$$ Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-031-66149-5_7openalex-snapshot
Random Access on Narrow Decision Diagrams in External Memory
inferred← citeshttps://doi.org/10.1007/978-3-322-83092-0_16openalex-snapshot
Die Logiken von Boole und Büchi-Elgot-Trakhtenbrot in der Beschreibung diskreter Systeme
inferred← citeshttps://doi.org/10.1007/978-3-540-31959-7_12openalex-snapshot
Application and Formal Specification of Sorted Term-Position Algebras
inferred← citeshttps://doi.org/10.1007/978-3-540-39813-4_2openalex-snapshot
Disproving False Conjectures
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_1openalex-snapshot
Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_8openalex-snapshot
An Incremental Technique for Automata-Based Decision Procedures
inferred← citeshttps://doi.org/10.1007/978-3-540-74610-2_12openalex-snapshot
Logic Programming Approach to Automata-Based Decision Procedures
inferred← citeshttps://doi.org/10.1007/978-3-642-03359-9_12openalex-snapshot
Formalizing the Logic-Automaton Connection
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_50openalex-snapshot
On Array Theory of Bounded Elements
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_45openalex-snapshot
Symbolic Automata Constraint Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-17511-4_18openalex-snapshot
Synthesis of Trigger Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-27660-6_8openalex-snapshot
Recent Challenges and Ideas in Temporal Synthesis
inferred← citeshttps://doi.org/10.1007/bfb0028773openalex-snapshot
MONA 1.x: New techniques for WS1S and WS2S
inferred← citeshttps://doi.org/10.1007/bfb0055785openalex-snapshot
A (non-elementary) modular decision procedure for LTrL
inferred← citeshttps://doi.org/10.1007/s10817-013-9293-6openalex-snapshot
Array Theory of Bounded Elements and its Applications
inferred← citeshttps://doi.org/10.1007/s10990-005-7007-4openalex-snapshot
Relativizations for the Logic-Automata Connection
inferred← citeshttps://doi.org/10.1007/s11219-019-09449-2openalex-snapshot
An efficient regression testing approach for PHP Web applications using test selection and reusable constraints
inferred← citeshttps://doi.org/10.1016/j.datak.2006.11.003openalex-snapshot
Deciding XPath containment with MSO
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.05.026openalex-snapshot
Automatic Verification of Bossa Scheduler Properties
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.11.002openalex-snapshot
Incremental reasoning on monadic second-order logics with logic programming
inferred← citeshttps://doi.org/10.1016/j.jlamp.2016.02.005openalex-snapshot
Logic programming approach to automata-based decision procedures
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00089-0openalex-snapshot
Decision procedures for inductive Boolean functions based on alternating automata
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80022-xopenalex-snapshot
19 Applications of modal logic in linguistics
inferred← citeshttps://doi.org/10.1023/a:1011254632723openalex-snapshot
Model Checking of Safety Properties
inferred← citeshttps://doi.org/10.1023/a:1012291501330openalex-snapshot
Finite State Transducers with Predicates and Identities
inferred← citeshttps://doi.org/10.1023/a:1020887910943openalex-snapshot
Model Checking Techniqes for the Analysis of Reactive Systems
inferred← citeshttps://doi.org/10.1109/icst.2010.15openalex-snapshot
Rex: Symbolic Regular Expression Explorer
inferred← citeshttps://doi.org/10.1109/icstw.2014.35openalex-snapshot
Regression Testing for Web Applications Using Reusable Constraint Values
inferred← citeshttps://doi.org/10.1109/jproc.2015.2450937openalex-snapshot
Component-Based Design by Solving Language Equations
inferred← citeshttps://doi.org/10.1109/lics.1998.705640openalex-snapshot
Existential second-order logic over strings
inferred← citeshttps://doi.org/10.1109/tac.2005.860291openalex-snapshot
Global and local consistencies in distributed fault diagnosis for discrete-event systems
inferred← citeshttps://doi.org/10.1145/1456650.1456654openalex-snapshot
Solving problems on recursively constructed graphs
inferred← citeshttps://doi.org/10.1145/325478.325480openalex-snapshot
Model-checking concurrent systems with unbounded integer variables
inferred← citeshttps://doi.org/10.1145/331605.331609openalex-snapshot
Existential second-order logic over strings
inferred← citeshttps://doi.org/10.1145/335168.335217openalex-snapshot
Expressive and efficient pattern languages for tree-structured data (extended abstract)
inferred← citeshttps://doi.org/10.1145/3484198openalex-snapshot
A Survey on String Constraint Solving
inferred← citeshttps://doi.org/10.1145/378795.378851openalex-snapshot
The pointer assertion logic engine
inferred← citeshttps://doi.org/10.1201/b16132-74openalex-snapshot
Algorithms on Recursively Constructed Graphs
inferred← citeshttps://doi.org/10.1609/icaps.v31i1.15954openalex-snapshot
Compositional Approach to Translate LTLf/LDLf into Deterministic Finite Automata
inferred← citeshttps://doi.org/10.22024/unikent/01.02.86456openalex-snapshot
Verification of real-time systems: improving tool support
inferred← citeshttps://doi.org/10.3115/1220575.1220645openalex-snapshot
Using MONA for querying linguistic treebanks
inferred← citeshttps://doi.org/10.3115/977035.977053openalex-snapshot
Transducers from rewrite rules with backreferences
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2013.04334openalex-snapshot
Progress in Research on String Analysis
inferred← citeshttps://doi.org/10.48456/tr-601openalex-snapshot
Combining model checking and theorem proving
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.