Ziyuan Gao

According to our database1, Ziyuan Gao authored at least 25 papers between 2012 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
A computation model with automatic functions and relations as primitive operations.
Theor. Comput. Sci., 2022

Alternating Automatic Register Machines.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2022, 2022

On the Reform of Virtual Simulation Experiment Teaching Mode for Economics and Management Specialty: A Case Study.
Proceedings of the ICDEL 2022: The 7th International Conference on Distance Education and Learning, Beijing, China, May 20, 2022

2021
Bi-immunity over different size alphabets.
Theor. Comput. Sci., 2021

The one-cop-moves game on planar graphs.
J. Comb. Optim., 2021

Learnability and Positive Equivalence Relations.
Proceedings of the Language and Automata Theory and Applications, 2021

2020
Finitely distinguishable erasing pattern languages.
Theor. Comput. Sci., 2020

Ordered Semiautomatic Rings with Applications to Geometry.
Proceedings of the Language and Automata Theory and Applications, 2020

2019
Random Subgroups of Rationals.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

The Teaching Complexity of Erasing Pattern Languages with Bounded Variable Frequency.
Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

2018
On the teaching complexity of linear sets.
Theor. Comput. Sci., 2018

On the Help of Bounded Shot Verifiers, Comparators and Standardisers for Learnability in Inductive Inference.
Proceedings of the Algorithmic Learning Theory, 2018

2017
Preference-based Teaching.
J. Mach. Learn. Res., 2017

Distinguishing pattern languages with membership examples.
Inf. Comput., 2017

The Cop Number of the One-Cop-Moves Game on Planar Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2017

Preference-based Teaching of Unions of Geometric Objects.
Proceedings of the International Conference on Algorithmic Learning Theory, 2017

Erasing Pattern Languages Distinguishable by a Finite Number of Strings.
Proceedings of the International Conference on Algorithmic Learning Theory, 2017

2016
Partial learning of recursively enumerable languages.
Theor. Comput. Sci., 2016

Classifying the Arithmetical Complexity of Teaching Models.
Proceedings of the Algorithmic Learning Theory - 27th International Conference, 2016

2015
Combining Models of Approximation with Partial Learning.
Proceedings of the Algorithmic Learning Theory - 26th International Conference, 2015

2014
Confident and consistent partial learning of recursive functions.
Theor. Comput. Sci., 2014

Distinguishing Pattern Languages with Membership Examples.
Proceedings of the Language and Automata Theory and Applications, 2014

2013
On Conservative Learning of Recursively Enumerable Languages.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
Learnability of Co-r.e. Classes.
Proceedings of the Language and Automata Theory and Applications, 2012

Learning Families of Closed Sets in Matroids.
Proceedings of the Computation, Physics and Beyond, 2012


  Loading...