Author of the publication

Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem.

, , and . WALCOM, volume 11355 of Lecture Notes in Computer Science, page 248-260. Springer, (2019)

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. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Sin'ya, Ryoma
add a person with the name Sin'ya, Ryoma
 

Other publications of authors with the same name

On Average-Case Hardness of Higher-Order Model Checking., , , , and . FSCD, volume 167 of LIPIcs, page 21:1-21:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Context-Freeness of Word-MIX Languages.. DLT, volume 12086 of Lecture Notes in Computer Science, page 304-318. Springer, (2020)Simultaneous Finite Automata: An Efficient Data-Parallel Model for Regular Expression Matching., , and . ICPP, page 220-229. IEEE Computer Society, (2013)Simultaneous Finite Automata: An Efficient Data-Parallel Model for Regular Expression Matching., , and . CoRR, (2014)Carathéodory Extensions of Subclasses of Regular Languages.. DLT, volume 12811 of Lecture Notes in Computer Science, page 355-367. Springer, (2021)Graph Spectral Properties of Deterministic Finite Automata - (Short Paper).. Developments in Language Theory, volume 8633 of Lecture Notes in Computer Science, page 76-83. Springer, (2014)Almost Every Simply Typed λ-Term Has a Long β-Reduction Sequence., , , and . FoSSaCS, volume 10203 of Lecture Notes in Computer Science, page 53-68. (2017)Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem., , and . WALCOM, volume 11355 of Lecture Notes in Computer Science, page 248-260. Springer, (2019)Measuring Power of Generalised Definite Languages.. CIAA, volume 14151 of Lecture Notes in Computer Science, page 278-289. Springer, (2023)Measuring Power of Locally Testable Languages.. DLT, volume 13257 of Lecture Notes in Computer Science, page 274-285. Springer, (2022)