( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations.

, , , и . Discret. Appl. Math., (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Ryo Sugihara

Ryo Kohsaka

Jong Won Ryoo

So Young Ryou

Mun Il Ryoo

 

Другие публикации лиц с тем же именем

Distribution Loss Minimization With Guaranteed Error Bound., , , , , , , , и . IEEE Trans. Smart Grid, 5 (1): 102-111 (2014)Extending Distributional Learning from Positive Data and Membership Queries., и . ICGI, том 217 из Proceedings of Machine Learning Research, стр. 8-22. PMLR, (2023)The Complexity and Generative Capacity of Lexicalized Abstract Categorial Grammars., и . LACL, том 3492 из Lecture Notes in Computer Science, стр. 330-346. Springer, (2005)New Variants of Pattern Matching with Constants and Variables., , , и . SOFSEM, том 10706 из Lecture Notes in Computer Science, стр. 611-623. Springer, (2018)Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages., , , и . SOFSEM, том 14519 из Lecture Notes in Computer Science, стр. 340-354. Springer, (2024)Notes on Sequence Binary Decision Diagrams: Relationship to Acyclic Automata and Complexities of Binary Set Operations., , , и . Stringology, стр. 147-161. Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2011)Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data.. ICGI, том 4201 из Lecture Notes in Computer Science, стр. 45-58. Springer, (2006)Grammar Compression with Probabilistic Context-Free Grammar., , , , и . DCC, стр. 386. IEEE, (2020)Distributional Learning and Context/Substructure Enumerability in Nonlinear Tree Grammars., и . FG, том 9804 из Lecture Notes in Computer Science, стр. 94-111. Springer, (2015)Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher., и . FG, том 7395 из Lecture Notes in Computer Science, стр. 192-207. Springer, (2010)