On the public citation graph
On the expressiveness of real and integer arithmetic automata
0 signed · 76 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-58179-0_43openalex-snapshot
Symbolic verification with periodic sets
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_18openalex-snapshot
An improved reachability analysis method for strongly linear hybrid systems (extended abstract)
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/978-1-4613-8928-6_23openalex-snapshot
On a Decision Method in Restricted Second Order Arithmetic
inferredcites →https://doi.org/10.1007/bf00967164openalex-snapshot
Presburgerness of predicates regular in two number systems
inferredcites →https://doi.org/10.1007/bf01746527openalex-snapshot
On the base-dependence of sets of numbers recognizable by finite automata
inferredcites →https://doi.org/10.1016/0304-3975(92)90256-fopenalex-snapshot
The theory of 〈N, +, Vk, Vl〉 is undecidable
inferredcites →https://doi.org/10.1016/0304-3975(94)00202-topenalex-snapshot
The algorithmic analysis of hybrid systems
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferredcites →https://doi.org/10.1109/lics.1996.561342openalex-snapshot
The theory of hybrid automata
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/136035.136043openalex-snapshot
Symbolic Boolean manipulation with ordered binary-decision diagrams
inferredcites →https://doi.org/10.36045/bbms/1103408547openalex-snapshot
Logic and {$p$}-recognizable sets of integers
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11527862_1openalex-snapshot
Verifying the Incorrectness of Programs and Automata
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_48openalex-snapshot
Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks
inferred← citeshttps://doi.org/10.1007/3-540-45614-7_10openalex-snapshot
Mechanical Abstraction of CSPZ Processes
inferred← citeshttps://doi.org/10.1007/3-540-45619-8_1openalex-snapshot
Representing Arithmetic Constraints with Finite Automata: An Overview
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_50openalex-snapshot
On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_1openalex-snapshot
On the Construction of Automata from Linear Arithmetic Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-40608-0_3openalex-snapshot
Approaching Arithmetic Theories with Finite-State Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-40608-0_8openalex-snapshot
$$\langle \mathbb {R}, +,<,1 \rangle $$ Is Decidable in $$\langle \mathbb {R}, +,< ,\mathbb {Z}\rangle $$
inferred← citeshttps://doi.org/10.1007/978-3-031-65627-9_3openalex-snapshot
Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-031-66159-4_19openalex-snapshot
Verifying and Interpreting Neural Networks Using Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-69152-7_3openalex-snapshot
First-Order Logic and Numeration Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24730-2_41openalex-snapshot
Omega-Regular Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_19openalex-snapshot
Hybrid Acceleration Using Real Vector Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_8openalex-snapshot
Dense Counter Machines and Verification Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-69166-2_4openalex-snapshot
Convex Hull of Arithmetic Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_10openalex-snapshot
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
inferred← citeshttps://doi.org/10.1007/978-3-540-70844-5_12openalex-snapshot
Computing Convex Hulls by Automata Iteration
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_70openalex-snapshot
A Generalization of Cobham’s Theorem to Automata over Real Numbers
inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_34openalex-snapshot
A Generalization of Semenov’s Theorem to Automata over Real Numbers
inferred← citeshttps://doi.org/10.1007/978-3-642-14455-4_6openalex-snapshot
Numeration Systems: A Link between Number Theory and Formal Language Theory
inferred← citeshttps://doi.org/10.1007/bfb0028736openalex-snapshot
Verifying systems with infinite but regular state spaces
inferred← citeshttps://doi.org/10.1007/s00012-018-0572-2openalex-snapshot
Fractional parts of dense additive subgroups of real numbers
inferred← citeshttps://doi.org/10.1007/s00029-021-00668-9openalex-snapshot
A tetrachotomy for expansions of the real ordered additive group
inferred← citeshttps://doi.org/10.1007/s00224-004-1133-yopenalex-snapshot
Finite Presentations of Infinite Structures: Automata and Interpretations
inferred← citeshttps://doi.org/10.1007/s10009-011-0209-7openalex-snapshot
Extrapolating (omega-)regular model checking
inferred← citeshttps://doi.org/10.1007/s11856-018-1635-yopenalex-snapshot
Interpreting the monadic second order theory of one successor in expansions of the real line
inferred← citeshttps://doi.org/10.1016/j.aim.2015.04.008openalex-snapshot
An analogue of Cobham's theorem for graph directed iterated function systems
inferred← citeshttps://doi.org/10.1016/j.apal.2019.05.001openalex-snapshot
When is scalar multiplication decidable?
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.020openalex-snapshot
On the Use of Automata-based Techniques in Symbolic Model Checking
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105398openalex-snapshot
Verifying and interpreting neural networks using finite automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.03.035openalex-snapshot
Finite automata encoding geometric figures
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.051openalex-snapshot
A generalization of Cobham’s theorem to automata over real numbers
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00743-0openalex-snapshot
Pushdown timed automata: a binary reachability characterization and safety verification
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80338-xopenalex-snapshot
An ω-Automata Approach to the Compression of Bi-Level Images
inferred← citeshttps://doi.org/10.1017/jsl.2015.34openalex-snapshot
EXPANSIONS OF THE ORDERED ADDITIVE GROUP OF REAL NUMBERS BY TWO DISCRETE SUBGROUPS
inferred← citeshttps://doi.org/10.1017/jsl.2023.55openalex-snapshot
FRACTAL DIMENSIONS OF k-AUTOMATIC SETS
inferred← citeshttps://doi.org/10.1090/tran/8499openalex-snapshot
Externally definable quotients and NIP expansions of the real ordered additive group
inferred← citeshttps://doi.org/10.1109/lics.2004.1319605openalex-snapshot
On the automata size for Presburger arithmetic
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00011openalex-snapshot
Quantifier Elimination for Regular Integer Linear-Exponential Programming
inferred← citeshttps://doi.org/10.1109/time.2001.930715openalex-snapshot
Representing periodic temporal information with automata
inferred← citeshttps://doi.org/10.1109/tsmcb.2003.811123openalex-snapshot
An w-automata approach to the representation of bilevel images
inferred← citeshttps://doi.org/10.1145/1071596.1071601openalex-snapshot
An effective decision procedure for linear arithmetic over the integers and reals
inferred← citeshttps://doi.org/10.1145/1342991.1342995openalex-snapshot
Bounds on the automata size for Presburger arithmetic
inferred← citeshttps://doi.org/10.1145/1838552.1838554openalex-snapshot
On (Omega-)regular model checking
inferred← citeshttps://doi.org/10.1145/2933575.2934552openalex-snapshot
First-order logic with reachability for infinite-state systems
inferred← citeshttps://doi.org/10.2168/lmcs-6(1:6)2010openalex-snapshot
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
inferred← citeshttps://doi.org/10.23638/lmcs-16(1:17)2020openalex-snapshot
Continuous Regular Functions
inferred← citeshttps://doi.org/10.23638/lmcs-17(2:18)2021openalex-snapshot
Theories of real addition with and without a predicate for integers
inferred← citeshttps://doi.org/10.3233/fi-222140openalex-snapshot
Decidability of Definability Issues in the Theory of Real Addition
inferred← citeshttps://doi.org/10.37236/9068openalex-snapshot
Minimal Automaton for Multiplying and Translating the Thue-Morse Set
inferred← citeshttps://doi.org/10.4115/jla.2023.15.5openalex-snapshot
Fractals and the monadic second order theory of one successor
inferred← citeshttps://doi.org/10.4204/eptcs.305.3openalex-snapshot
State Complexity of the Multiples of the Thue-Morse Set
inferred← citeshttps://doi.org/10.48550/arxiv.1701.08426openalex-snapshot
Definability and decidability in expansions by generalized Cantor sets
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0303019openalex-snapshot
An Effective Decision Procedure for Linear Arithmetic with Integer and Real Variables
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.