Specifications with Observable Formulae and Observational Satisfaction Relation. - Teodor Knapik (COMPASS/ADT, 1991)

Towards an Adequate Notion of Observation. - Gilles Bernot; Michel Bidoit; Teodor Knapik (ESOP, 1992)

Behavioural Approaches to Algebraic Specifications: A Comparative Study. - Gilles Bernot; Michel Bidoit; Teodor Knapik (Acta Informatica, 1994)

Observational Specifications and the Indistinguishability Assumption. - Gilles Bernot; Michel Bidoit; Teodor Knapik (Theor. Comput. Sci., 1995)

A String-Rewriting Characterization of Muller and Schupp's Context-Free Graphs. - Hugues Calbrix; Teodor Knapik (FSTTCS, 1998)

The Full Quotient and its Closure Property for Regular Languages. - Teodor Knapik; Étienne Payet (Inf. Process. Lett., 1998)

Synchronized Product of Linear Bounded Machines. - Teodor Knapik; Étienne Payet (FCT, 1999)

Thue Specifications and Their Monadic Second-order Properties. - Teodor Knapik; Hugues Calbrix (Fundam. Informaticae, 1999)

Deciding Monadic Theories of Hyperalgebraic Trees. - Teodor Knapik; Damian Niwinski; Pawel Urzyczyn (TLCA, 2001)

An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs. - Didier Caucal; Teodor Knapik (Theory Comput. Syst., 2001)

Higher-Order Pushdown Trees Are Easy. - Teodor Knapik; Damian Niwinski; Pawel Urzyczyn (FoSSaCS, 2002)

A Chomsky-Like Hierarchy of Infinite Graphs. - Didier Caucal; Teodor Knapik (MFCS, 2002)

Checking Simple Properties of Transition Systems Defined by Thue Specifications. - Teodor Knapik (J. Autom. Reason., 2002)

The evaluation of first-order substitution is monadic second-order compatible. - Bruno Courcelle; Teodor Knapik (Theor. Comput. Sci., 2002)

Using Transitive-Closure Logic for Deciding Linear Properties of Monoids. - Christian Delhommé; Teodor Knapik; D. Gnanaraj Thomas (MFCS, 2003)

Unsafe Grammars and Panic Automata. - Teodor Knapik; Damian Niwinski; Pawel Urzyczyn; Igor Walukiewicz (ICALP, 2005)

Higher order indexed monadic systems. - Didier Caucal; Teodor Knapik (FSTTCS, 2011)

Verification of Message Sequence Structures. - Meenakshi D'Souza; Teodor Knapik (ICDCIT, 2013)

Shelah-Stupp's Iteration and Muchnik's Iteration. - Didier Caucal; Teodor Knapik (Fundam. Informaticae, 2018)

Signal automata and hidden Markov models. - Teodor Knapik (CoRR, 2021)

An experimental evaluation of choices of SSA forecasting parameters. - Teodor Knapik; Adolphe Ratiarison; Hasina Razafindralambo (ARIMA J., 2024)

Lindenmayer graph languages, first-order theories and expanders. - Teodor Knapik (CoRR, 2024)