On the public citation graph

Automata and Logics for Words and Trees over an Infinite Alphabet

https://doi.org/10.1007/11874683_3
0 signed · 182 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.1006/inco.1994.1085openalex-snapshot
Finite-State Unification Automata and Relational Languages
inferredcites →https://doi.org/10.1006/inco.2001.2953openalex-snapshot
First-Order Logic with Two Variables and Unary Temporal Logic
inferredcites →https://doi.org/10.1007/11601524_13openalex-snapshot
Efficient Memory Representation of XML Documents
inferredcites →https://doi.org/10.1007/11601524_8openalex-snapshot
Satisfiability of XPath Queries with Sibling Axes
inferredcites →https://doi.org/10.1007/11812128_8openalex-snapshot
Finding Common Motifs with Gaps Using Finite Automata
inferredcites →https://doi.org/10.1007/3-540-12920-0_24openalex-snapshot
Automates a pile sur des alphabets infinis
inferredcites →https://doi.org/10.1007/3-540-36285-1_21openalex-snapshot
XPath Containment in the Presence of Disjunction, DTDs, and Variables
inferredcites →https://doi.org/10.1007/3-540-36285-1_6openalex-snapshot
Structural Properties of XPath Fragments
inferredcites →https://doi.org/10.1007/3-540-44683-4_18openalex-snapshot
Automatic Verification of Recursive Procedures with One Integer Parameter
inferredcites →https://doi.org/10.1007/978-3-540-27798-9_20openalex-snapshot
Regular Expressions for Languages over Infinite Alphabets
inferredcites →https://doi.org/10.1007/978-3-540-30570-5_8openalex-snapshot
First Order Paths in Ordered Trees
inferredcites →https://doi.org/10.1007/978-3-540-30597-2_2openalex-snapshot
Consistency of XML Specifications
inferredcites →https://doi.org/10.1007/b104925openalex-snapshot
Inconsistency Tolerance
inferredcites →https://doi.org/10.1007/s002360050120openalex-snapshot
Context-free languages over infinite alphabets
inferredcites →https://doi.org/10.1016/0166-218x(80)90050-5openalex-snapshot
Langages sur des alphabets infinis
inferredcites →https://doi.org/10.1016/0166-218x(85)90039-3openalex-snapshot
Classes of regular and context-free languages over countably infinite alphabets
inferredcites →https://doi.org/10.1016/0304-3975(94)90242-9openalex-snapshot
Finite-memory automata
inferredcites →https://doi.org/10.1016/s0022-0000(03)00032-1openalex-snapshot
XML with data values: typechecking revisited
inferredcites →https://doi.org/10.1016/s0304-3975(02)00397-3openalex-snapshot
Automatic verification of recursive procedures with one integer parameter
inferredcites →https://doi.org/10.1016/s0304-3975(03)00246-9openalex-snapshot
An algebraic characterization of deterministic regular languages over infinite alphabets
inferredcites →https://doi.org/10.1016/s0304-3975(99)00105-xopenalex-snapshot
Intractability of decision problems for finite-memory automata
inferredcites →https://doi.org/10.1016/s0306-4379(03)00028-0openalex-snapshot
Reasoning about keys for XML
inferredcites →https://doi.org/10.1016/s0890-5401(03)00038-5openalex-snapshot
An algebraic approach to data languages and timed languages
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.2004.1319601openalex-snapshot
Vector addition tree automata
inferredcites →https://doi.org/10.1109/lics.2006.51openalex-snapshot
Two-Variable Logic on Words with Data
inferredcites →https://doi.org/10.1109/time.2005.28openalex-snapshot
On the Freeze Quantifier in Constraint LTL: Decidability and Complexity
inferredcites →https://doi.org/10.1137/0213029openalex-snapshot
An Algorithm for the General Petri Net Reachability Problem
inferredcites →https://doi.org/10.1145/1013560.1013562openalex-snapshot
Finite state machines for strings over infinite alphabets
inferredcites →https://doi.org/10.1145/1065167.1065172openalex-snapshot
XPath satisfiability in the presence of DTDs
inferredcites →https://doi.org/10.1145/1142351.1142354openalex-snapshot
Two-variable logic on data trees and XML reasoning
inferredcites →https://doi.org/10.1145/1507244.1507246openalex-snapshot
LTL with the freeze quantifier and register automata
inferredcites →https://doi.org/10.1145/800070.802201openalex-snapshot
Decidability of reachability in vector addition systems (Preliminary Version)
inferredcites →https://doi.org/10.3233/fun-2006-69304openalex-snapshot
Regular Expressions for Languages over Infinite Alphabets

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-02508-3_22openalex-snapshot
Complexity Results on Register Context-Free Grammars and Register Tree Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-02508-3_26openalex-snapshot
Fast Computations on Ordered Nominal Sets
inferred← citeshttps://doi.org/10.1007/978-3-030-40608-0_14openalex-snapshot
Pebble-Intervals Automata and FO$$^2$$ with Two Orders
inferred← citeshttps://doi.org/10.1007/978-3-030-71995-1_19openalex-snapshot
Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages
inferred← citeshttps://doi.org/10.1007/978-3-030-85315-0_19openalex-snapshot
Reactive Synthesis from Visibly Register Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-91384-7_10openalex-snapshot
A Taxonomy and Reductions for Common Register Automata Formalisms
inferred← citeshttps://doi.org/10.1007/978-3-031-07469-1_5openalex-snapshot
Symbolic Weighted Language Models, Quantitative Parsing and Automated Music Transcription
inferred← citeshttps://doi.org/10.1007/978-3-031-13188-2_13openalex-snapshot
Reasoning About Data Trees Using CHCs
inferred← citeshttps://doi.org/10.1007/978-3-031-37709-9_14openalex-snapshot
Automatic Program Instrumentation for Automatic Verification
inferred← citeshttps://doi.org/10.1007/978-3-031-71112-1_1openalex-snapshot
Automata and Grammars for Data Words
inferred← citeshttps://doi.org/10.1007/978-3-319-02444-8_28openalex-snapshot
An Automata-Theoretic Approach to Reasoning about Parameterized Systems and Specifications
inferred← citeshttps://doi.org/10.1007/978-3-319-04921-2_20openalex-snapshot
Satisfiability for MTL and TPTL over Non-monotonic Data Words
inferred← citeshttps://doi.org/10.1007/978-3-319-07317-0_2openalex-snapshot
Deadlock Detection in Linear Recursive Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-15579-1_14openalex-snapshot
Weak and Nested Class Memory Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-24953-7_30openalex-snapshot
Game Semantic Analysis of Equivalence in IMJ
inferred← citeshttps://doi.org/10.1007/978-3-319-40946-7_1openalex-snapshot
Decision Problems for Finite Automata over Infinite Algebraic Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-45994-3_13openalex-snapshot
Insertion-Deletion Systems over Relational Words
inferred← citeshttps://doi.org/10.1007/978-3-319-47169-3_25openalex-snapshot
What Is a Trace? A Runtime Verification Perspective
inferred← citeshttps://doi.org/10.1007/978-3-319-53733-7_6openalex-snapshot
$$\mathbb {N}$$ -Memory Automata over the Alphabet $$\mathbb {N}$$
inferred← citeshttps://doi.org/10.1007/978-3-319-56841-6_6openalex-snapshot
Formal Reasoning on Infinite Data Values: An Ongoing Quest
inferred← citeshttps://doi.org/10.1007/978-3-319-75650-9_11openalex-snapshot
Monitoring of Security Properties Using BeepBeep
inferred← citeshttps://doi.org/10.1007/978-3-540-72734-7_13openalex-snapshot
A Decidable Temporal Logic of Repeating Values
inferred← citeshttps://doi.org/10.1007/978-3-540-74240-1_9openalex-snapshot
On Notions of Regularity for Data Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_66openalex-snapshot
Shuffle Expressions and Words with Nested Data
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_34openalex-snapshot
Model Checking Freeze LTL over One-Counter Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_8openalex-snapshot
Dependency Tree Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-00945-7_2openalex-snapshot
Model Checking Usage Policies
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_37openalex-snapshot
On the Hybrid Extension of CTL and CTL +
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_60openalex-snapshot
On Pebble Automata for Data Languages with Decidable Emptiness Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-04420-5_14openalex-snapshot
Counting Multiplicity over Infinite Alphabets
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_1openalex-snapshot
Introduction to Decidability of Higher-Order Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_12openalex-snapshot
Automata vs. Logics on Data Words
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_38openalex-snapshot
Two-Variable Logic with Two Order Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-15675-5_3openalex-snapshot
Counter Systems for Data Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-23217-6_12openalex-snapshot
An Automaton over Data Words That Captures EMSO Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-24372-1_26openalex-snapshot
A Succinct Canonical Register Automaton Model
inferred← citeshttps://doi.org/10.1007/978-3-642-28472-4_2openalex-snapshot
Foundations of XML Based on Logic and Automata: A Snapshot
inferred← citeshttps://doi.org/10.1007/978-3-642-28717-6_22openalex-snapshot
Regular Expressions for Data Words
inferred← citeshttps://doi.org/10.1007/978-3-642-28729-9_17openalex-snapshot
On Nominal Regular Languages with Binders
inferred← citeshttps://doi.org/10.1007/978-3-642-29952-0_37openalex-snapshot
Finite Automata over Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_14openalex-snapshot
Toward Model Theory with Data Values
inferred← citeshttps://doi.org/10.1007/978-3-642-31606-7_11openalex-snapshot
Nominal Automata for Resource Usage Control
inferred← citeshttps://doi.org/10.1007/978-3-642-33386-6_6openalex-snapshot
A Succinct Canonical Register Automaton Model for Data Domains with Binary Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-33475-7_14openalex-snapshot
A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions
inferred← citeshttps://doi.org/10.1007/978-3-642-35873-9_14openalex-snapshot
Static Analysis of String Encoders and Decoders
inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_19openalex-snapshot
Runtime Verification Based on Register Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_17openalex-snapshot
Dynamic Communicating Automata and Branching High-Level MSCs
inferred← citeshttps://doi.org/10.1007/978-3-642-37075-5_2openalex-snapshot
History-Register Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-38771-5_12openalex-snapshot
A Fresh Approach to Learning Register Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-38771-5_29openalex-snapshot
Regular Expressions with Binding over Data Words for Querying Graph Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-39274-0_11openalex-snapshot
Towards Nominal Context-Free Model-Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-39274-0_3openalex-snapshot
Applications of Symbolic Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_41openalex-snapshot
Equivalence of Extended Symbolic Finite Transducers
inferred← citeshttps://doi.org/10.1007/978-3-642-41660-6_15openalex-snapshot
Static Analysis and Query Answering for Incomplete Data Trees with Constraints
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_39openalex-snapshot
Reachability in Pushdown Register Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-46823-4_27openalex-snapshot
Symbolic String Transformations with Regular Lookahead and Rollback
inferred← citeshttps://doi.org/10.1007/978-3-662-54458-7_12openalex-snapshot
Logics of Repeating Values on Data Trees and Branching Counter Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-54458-7_8openalex-snapshot
Nominal Automata with Name Binding
inferred← citeshttps://doi.org/10.1007/s00224-015-9617-5openalex-snapshot
Highly Expressive Query Languages for Unordered Data Trees
inferred← citeshttps://doi.org/10.1007/s00224-020-09997-2openalex-snapshot
The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata
inferred← citeshttps://doi.org/10.1007/s00236-019-00347-5openalex-snapshot
Subsequence versus substring constraints in sequence pattern languages
inferred← citeshttps://doi.org/10.1007/s10009-020-00566-zopenalex-snapshot
Automata-based monitoring for LTL-FO$$^+$$
inferred← citeshttps://doi.org/10.1007/s10703-015-0233-4openalex-snapshot
Extended symbolic finite automata and transducers
inferred← citeshttps://doi.org/10.1007/s10703-026-00493-wopenalex-snapshot
A program instrumentation framework for automatic verification
inferred← citeshttps://doi.org/10.1016/j.ipl.2014.11.005openalex-snapshot
Symbolic tree automata
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.03.004openalex-snapshot
On pebble automata for data languages with decidable emptiness problem
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.03.005openalex-snapshot
Regular expressions for data words
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.02.008openalex-snapshot
Reachability in pushdown register automata
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.09.005openalex-snapshot
Containment of queries for graphs with data
inferred← citeshttps://doi.org/10.1016/j.jlamp.2014.07.004openalex-snapshot
A succinct canonical register automaton model
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.10.009openalex-snapshot
On notions of regularity for data languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.02.021openalex-snapshot
Model checking memoryful linear-time logics over one-counter automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.09.002openalex-snapshot
Fast computations on ordered nominal sets
inferred← citeshttps://doi.org/10.1017/s096012951200093xopenalex-snapshot
Model checking usage policies
inferred← citeshttps://doi.org/10.1093/logcom/exr013openalex-snapshot
Temporal Logics of Repeating Values
inferred← citeshttps://doi.org/10.1109/ccdc65474.2025.11090176openalex-snapshot
Opacity of Parametric Discrete Event Systems
inferred← citeshttps://doi.org/10.1109/lics.2006.31openalex-snapshot
LTL with the Freeze Quantifier and Register Automata
inferred← citeshttps://doi.org/10.1109/lics.2007.11openalex-snapshot
Alternation-free modal mu-calculus for data trees
inferred← citeshttps://doi.org/10.1109/lics.2007.23openalex-snapshot
Higher-Order Matching, Games and Automata
inferred← citeshttps://doi.org/10.1109/lics.2009.23openalex-snapshot
Graph Reachability and Pebble Automata over Infinite Alphabets
inferred← citeshttps://doi.org/10.1109/lics.2010.28openalex-snapshot
The Emptiness Problem for Tree Automata with Global Constraints
inferred← citeshttps://doi.org/10.1109/lics.2010.33openalex-snapshot
An Extension of Data Automata that Captures XPath
inferred← citeshttps://doi.org/10.1109/lics.2011.48openalex-snapshot
Automata with Group Actions
inferred← citeshttps://doi.org/10.1109/lics.2013.8openalex-snapshot
Reasoning about Data Repetitions with Counter Systems
inferred← citeshttps://doi.org/10.1109/lics.2015.24openalex-snapshot
Bisimilarity in Fresh-Register Automata
inferred← citeshttps://doi.org/10.1109/lics.2017.8005111openalex-snapshot
Register automata with linear arithmetic
inferred← citeshttps://doi.org/10.1109/lics.2019.8785736openalex-snapshot
History-Dependent Nominal μ-Calculus
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470626openalex-snapshot
Parikh’s theorem for infinite alphabets
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175808openalex-snapshot
On the Growth Rates of Polyregular Functions
inferred← citeshttps://doi.org/10.1145/1507244.1507246openalex-snapshot
LTL with the freeze quantifier and register automata
inferred← citeshttps://doi.org/10.1145/1559795.1559801openalex-snapshot
XML schema mappings
inferred← citeshttps://doi.org/10.1145/1559795.1559832openalex-snapshot
XML with incomplete information
inferred← citeshttps://doi.org/10.1145/1870103.1870107openalex-snapshot
XML with incomplete information
inferred← citeshttps://doi.org/10.1145/1877714.1877716openalex-snapshot
Safety alternating automata on data words
inferred← citeshttps://doi.org/10.1145/1925844.1926420openalex-snapshot
Fresh-register automata
inferred← citeshttps://doi.org/10.1145/1926385.1926420openalex-snapshot
Fresh-register automata
inferred← citeshttps://doi.org/10.1145/1929954.1929956openalex-snapshot
Alternating automata on data trees and XPath satisfiability
inferred← citeshttps://doi.org/10.1145/1938551.1938571openalex-snapshot
Two-variable logic and key constraints on data words
inferred← citeshttps://doi.org/10.1145/1989284.1989317openalex-snapshot
Efficient evaluation for a temporal logic on changing XML documents
inferred← citeshttps://doi.org/10.1145/2103621.2103674openalex-snapshot
Symbolic finite state transducers
inferred← citeshttps://doi.org/10.1145/2103656.2103674openalex-snapshot
Symbolic finite state transducers
inferred← citeshttps://doi.org/10.1145/2274576.2274583openalex-snapshot
Highly expressive query languages for unordered data trees
inferred← citeshttps://doi.org/10.1145/2274576.2274585openalex-snapshot
Regular path queries on graphs with data
inferred← citeshttps://doi.org/10.1145/2499937.2499940openalex-snapshot
Graph Reachability and Pebble Automata over Infinite Alphabets
inferred← citeshttps://doi.org/10.1145/2590773openalex-snapshot
XML Schema Mappings
inferred← citeshttps://doi.org/10.1145/2676726.2677014openalex-snapshot
Data-Parallel String-Manipulating Programs
inferred← citeshttps://doi.org/10.1145/2775051.2677014openalex-snapshot
Data-Parallel String-Manipulating Programs
inferred← citeshttps://doi.org/10.1145/2850413openalex-snapshot
Querying Graphs with Data
inferred← citeshttps://doi.org/10.1145/2882903.2882944openalex-snapshot
Query Planning for Evaluating SPARQL Property Paths
inferred← citeshttps://doi.org/10.1145/2948896.2948902openalex-snapshot
An invitation to game semantics
inferred← citeshttps://doi.org/10.1145/3209108.3209154openalex-snapshot
Playing with Repetitions in Data Words Using Energy Games
inferred← citeshttps://doi.org/10.1145/3571230openalex-snapshot
A Robust Theory of Series Parallel Graphs
inferred← citeshttps://doi.org/10.1145/3808281openalex-snapshot
Towards Efficient Matching of Regexes with Backreferences using Register Set Automata
inferred← citeshttps://doi.org/10.1201/b13055-5openalex-snapshot
Tree Automata
inferred← citeshttps://doi.org/10.12681/eadd/53415openalex-snapshot
Learning regular languages over large alphabets
inferred← citeshttps://doi.org/10.14232/actacyb.23.1.2017.16openalex-snapshot
Weighted Recognizability over Infinite Alphabets
inferred← citeshttps://doi.org/10.1587/transinf.2022fcp0003openalex-snapshot
A Subclass of Mu-Calculus with the Freeze Quantifier Equivalent to Register Automata
inferred← citeshttps://doi.org/10.2168/lmcs-12(1:7)2016openalex-snapshot
History-Register Automata
inferred← citeshttps://doi.org/10.2168/lmcs-12(3:1)2016openalex-snapshot
Reasoning about Data Repetitions with Counter Systems
inferred← citeshttps://doi.org/10.2168/lmcs-5(3:2)2009openalex-snapshot
Decidability of higher-order matching
inferred← citeshttps://doi.org/10.2168/lmcs-8(1:15)2012openalex-snapshot
Two-Variable Logic with Two Order Relations
inferred← citeshttps://doi.org/10.2168/lmcs-8(1:5)2012openalex-snapshot
An extension of data automata that captures XPath
inferred← citeshttps://doi.org/10.23638/lmcs-15(4:5)2019openalex-snapshot
Scalar and Vectorial mu-calculus with Atoms
inferred← citeshttps://doi.org/10.23638/lmcs-16(3:1)2020openalex-snapshot
Playing with Repetitions in Data Words Using Energy Games
inferred← citeshttps://doi.org/10.23638/lmcs-17(1:22)2021openalex-snapshot
Synthesis of Data Word Transducers
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25d65openalex-snapshot
On Computability of Data Word Functions Defined by Transducers
inferred← citeshttps://doi.org/10.36227/techrxiv.23613015openalex-snapshot
Opacity of Parametric Discrete Event Systems: Models, Decidability, and Algorithms
inferred← citeshttps://doi.org/10.36227/techrxiv.23613015.v1openalex-snapshot
Opacity of Parametric Discrete Event Systems: Models, Decidability, and Algorithms
inferred← citeshttps://doi.org/10.4204/eptcs.151.12openalex-snapshot
On the Expressiveness of TPTL and MTL over ω-Data Words
inferred← citeshttps://doi.org/10.4204/eptcs.304.9openalex-snapshot
On Learning Nominal Automata with Binders
inferred← citeshttps://doi.org/10.4204/eptcs.54.9openalex-snapshot
A Decidable Extension of Data Automata
inferred← citeshttps://doi.org/10.4204/eptcs.96.16openalex-snapshot
Higher-Order Pushdown Systems with Data
inferred← citeshttps://doi.org/10.4230/lipics.csl.2012.528openalex-snapshot
Commutative Data Automata
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2009.2328openalex-snapshot
On Nondeterministic Unranked Tree Automata with Sibling Constraints
inferred← citeshttps://doi.org/10.46298/lmcs-17(3:27)2021openalex-snapshot
Modular Path Queries with Arithmetic
inferred← citeshttps://doi.org/10.46298/lmcs-20(3:1)2024openalex-snapshot
On the Satisfiability of Local First-Order Logics with Data
inferred← citeshttps://doi.org/10.46298/lmcs-21(1:13)2025openalex-snapshot
Bisimilarity in fresh-register automata
inferred← citeshttps://doi.org/10.48550/arxiv.0810.5517openalex-snapshot
Model checking memoryful linear-time logics over one-counter automata
inferred← citeshttps://doi.org/10.48550/arxiv.1310.3945openalex-snapshot
A decidable class of (nominal) omega-regular languages over an infinite alphabet
inferred← citeshttps://doi.org/10.48550/arxiv.1903.08053openalex-snapshot
Varieties of Data Languages
inferred← citeshttps://doi.org/10.48550/arxiv.1910.10357openalex-snapshot
Complexity Results on Register Pushdown Automata
inferred← citeshttps://doi.org/10.48550/arxiv.1912.00171openalex-snapshot
Pebble-Intervals Automata and FO2 with Two Orders (Extended Version)
inferred← citeshttps://doi.org/10.48550/arxiv.2110.04032openalex-snapshot
Symbolic Register Automata for Complex Event Recognition and Forecasting
inferred← citeshttps://doi.org/10.5441/002/icdt.2014.16openalex-snapshot
Containment of Data Graph Queries
inferred← citeshttps://doi.org/10.5555/3329995.3330046openalex-snapshot
Register automata with linear arithmetic
inferred← citeshttps://doi.org/10.70675/98022161z28f5z45a8za356z714fd4718e68openalex-snapshot
Tree automata with global constraints for the verification of security properties
inferred← citeshttps://doi.org/10.70675/bc873801z115cz462az9be1z279446b155a9openalex-snapshot
Automatic synthesis of systems with data
inferred← citeshttps://doi.org/10.70675/f51892c5z9581z4412zbe27zaa702a9e56dfopenalex-snapshot
Synthesis for parameterized systems
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.