From post

Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages.

, , и . LATA, том 6031 из Lecture Notes in Computer Science, стр. 596-607. Springer, (2010)

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.

 

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

Counterexamples to the long-standing conjecture on the complexity of BDD binary operations., , , , и . Inf. Process. Lett., 112 (16): 636-640 (2012)An Attempt Towards Learning Semantics: Distributional Learning of IO Context-Free Tree Grammars.. TAG, стр. 90-98. ACL, (2012)Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings., , , , , , , , и . SOFSEM, том 10139 из Lecture Notes in Computer Science, стр. 363-374. Springer, (2017)Duel and Sweep Algorithm for Order-Preserving Pattern Matching., , , , и . SOFSEM, том 10706 из Lecture Notes in Computer Science, стр. 624-635. Springer, (2018)Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations., , , и . Discret. Appl. Math., (2016)Preface., , , и . Fundam. Informaticae, 146 (4): i-ii (2016)Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages., , и . LATA, том 6031 из Lecture Notes in Computer Science, стр. 596-607. Springer, (2010)The Strong, Weak, and Very Weak Finite Context and Kernel Properties., и . LATA, том 10168 из Lecture Notes in Computer Science, стр. 77-88. (2017)AC-Automaton Update Algorithm for Semi-dynamic Dictionary Matching., , и . SPIRE, том 9954 из Lecture Notes in Computer Science, стр. 110-121. (2016)PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data., и . ALT, том 8139 из Lecture Notes in Computer Science, стр. 143-157. Springer, (2013)