( en | de | ru )

 

Disambiguation of "Knapik, Teodor"

Author of the publication

copydeleteadd this publication to your clipboard
Unsafe Grammars and Panic Automata.

, , , and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 1450-1461. Springer, (2005)

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.

Teodor Nebozuk

Teodor Schlomka

Teodor Ghetiu

Teodor Buburuzan

Teodor Elsner

 

Other publications of authors with the same name

Verification of Message Sequence Structures., and . ICDCIT, volume 7753 of Lecture Notes in Computer Science, page 171-182. Springer, (2013)Unsafe Grammars and Panic Automata., , , and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 1450-1461. Springer, (2005)Deciding Monadic Theories of Hyperalgebraic Trees., , and . TLCA, volume 2044 of Lecture Notes in Computer Science, page 253-267. Springer, (2001)Observational Specifications and the Indistinguishability Assumption., , and . Theor. Comput. Sci., 139 (1&2): 275-314 (1995)A Chomsky-Like Hierarchy of Infinite Graphs., and . MFCS, volume 2420 of Lecture Notes in Computer Science, page 177-187. Springer, (2002)Higher-Order Pushdown Trees Are Easy., , and . FoSSaCS, volume 2303 of Lecture Notes in Computer Science, page 205-222. Springer, (2002)Behavioural Approaches to Algebraic Specifications: A Comparative Study., , and . Acta Inf., 31 (7): 651-671 (1994)An experimental evaluation of choices of SSA forecasting parameters., , and . CoRR, (2024)An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs., and . Theory Comput. Syst., 34 (4): 299-336 (2001)The evaluation of first-order substitution is monadic second-order compatible., and . Theor. Comput. Sci., 281 (1-2): 177-206 (2002)