The following pages link to Tony Tan (Q1959426):
Displayed 26 items.
- On pebble automata for data languages with decidable emptiness problem (Q1959427) (← links)
- Subsequence versus substring constraints in sequence pattern languages (Q2022305) (← links)
- A simple combinatorial proof for the small model property of two-variable logic (Q2032164) (← links)
- Regular expressions for data words (Q2353403) (← links)
- Approximating polyhedral objects with deformable smooth surfaces (Q2462735) (← links)
- Feasible Automata for Two-Variable Logic with Successor on Data Words (Q2890205) (← links)
- Graph Reachability and Pebble Automata over Infinite Alphabets (Q2946705) (← links)
- On the Variable Hierarchy of First-Order Spectra (Q2957699) (← links)
- An Automata Model for Trees with Ordered Data Values (Q2986837) (← links)
- On Pebble Automata for Data Languages with Decidable Emptiness Problem (Q3182968) (← links)
- A Note on Two-pebble Automata Over Infinite Alphabets (Q3561220) (← links)
- Finite-State Map-Reduce Computation and Relational Algebra Queries (Q4581461) (← links)
- (Q4643954) (← links)
- Computing and Combinatorics (Q4681175) (← links)
- On the Satisfiability of Two-Variable Logic over Data Words (Q4933309) (← links)
- (Q5144658) (← links)
- REGULAR EXPRESSIONS FOR QUERYING DATA GRAPHS (Q5247169) (← links)
- Regular Graphs and the Spectra of Two-Variable Logic with Counting (Q5258916) (← links)
- Regular Expressions with Binding over Data Words for Querying Graph Databases (Q5300851) (← links)
- Extending two-variable logic on data trees with order on data values and its automata (Q5410335) (← links)
- Tree Automata over Infinite Alphabets (Q5452188) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465852) (← links)
- (Q5472919) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492862) (← links)
- (Q5738943) (← links)
- (Q6187052) (← links)