( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On Pumping RP-automata Controlled by Complete LRG(\cent, $)-grammars.

, , , и . ITAT, том 3226 из CEUR Workshop Proceedings, стр. 111-121. CEUR-WS.org, (2022)

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.

André Benedict Prusa

Zenonas Prusas

Sabine Prusak

Erwin Prusas

Alexander Prusak

 

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

Optimal strategies for reject option classifiers., , и . CoRR, (2021)Converting nondeterministic two-way automata into small deterministic linear-time machines., , , и . Inf. Comput., 289 (Part): 104938 (2022)Universality of the Local Marginal Polytope., и . IEEE Trans. Pattern Anal. Mach. Intell., 37 (4): 898-904 (2015)Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time., , , и . DLT, том 11088 из Lecture Notes in Computer Science, стр. 366-378. Springer, (2018)Recognizing Off-Line Flowcharts by Reconstructing Strokes and Using On-Line Recognition Techniques., , и . ICFHR, стр. 48-53. IEEE Computer Society, (2016)Two-Dimensional Pattern Matching Against Basic Picture Languages., , и . CIAA, том 11601 из Lecture Notes in Computer Science, стр. 209-221. Springer, (2019)How Hard Is the LP Relaxation of the Potts Min-Sum Labeling Problem?, и . EMMCVPR, том 8932 из Lecture Notes in Computer Science, стр. 57-70. Springer, (2014)Structural Construction for On-Line Mathematical Formulae Recognition., и . CIARP, том 5197 из Lecture Notes in Computer Science, стр. 317-324. Springer, (2008)Preface., , и . Fundam. Informaticae, (2021)Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program., и . SIAM J. Optim., 29 (3): 1745-1771 (2019)