Teodor Knapik

23 papers A* 1A 1B 4Misc 1Journal 12Unranked 4
YearRankTypeTitle / Venue / Authors
2024 J jnl
An experimental evaluation of choices of SSA forecasting parameters.
ARIMA J.
Teodor Knapik, Adolphe Ratiarison, Hasina Razafindralambo
2024 J jnl
An experimental evaluation of choices of SSA forecasting parameters.
CoRR
Teodor Knapik, Adolphe Ratiarison, Hasina Razafindralambo
2024 J jnl
Lindenmayer graph languages, first-order theories and expanders.
CoRR
Teodor Knapik
2021 J jnl
Signal automata and hidden Markov models.
CoRR
Teodor Knapik
2018 J jnl
Shelah-Stupp's Iteration and Muchnik's Iteration.
Fundam. Informaticae
Didier Caucal, Teodor Knapik
2013 Misc conf
Verification of Message Sequence Structures.
ICDCIT
Meenakshi D'Souza, Teodor Knapik
2011 — conf
Higher order indexed monadic systems.
FSTTCS
Didier Caucal, Teodor Knapik
2005 A* conf
Unsafe Grammars and Panic Automata.
ICALP
Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz
2003 B conf
Using Transitive-Closure Logic for Deciding Linear Properties of Monoids.
MFCS
Christian Delhommé, Teodor Knapik, D. Gnanaraj Thomas
2002 B conf
A Chomsky-Like Hierarchy of Infinite Graphs.
MFCS
Didier Caucal, Teodor Knapik
2002 J jnl
Checking Simple Properties of Transition Systems Defined by Thue Specifications.
J. Autom. Reason.
Teodor Knapik
2002 B conf
Higher-Order Pushdown Trees Are Easy.
FoSSaCS
Teodor Knapik, Damian Niwinski, Pawel Urzyczyn
2002 J jnl
The evaluation of first-order substitution is monadic second-order compatible.
Theor. Comput. Sci.
Bruno Courcelle, Teodor Knapik
2001 J jnl
An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs.
Theory Comput. Syst.
Didier Caucal, Teodor Knapik
2001 — conf
Deciding Monadic Theories of Hyperalgebraic Trees.
TLCA
Teodor Knapik, Damian Niwinski, Pawel Urzyczyn
1999 B conf
Synchronized Product of Linear Bounded Machines.
FCT
Teodor Knapik, Étienne Payet
1999 J jnl
Thue Specifications and Their Monadic Second-order Properties.
Fundam. Informaticae
Teodor Knapik, Hugues Calbrix
1998 — conf
A String-Rewriting Characterization of Muller and Schupp's Context-Free Graphs.
FSTTCS
Hugues Calbrix, Teodor Knapik
1998 J jnl
The Full Quotient and its Closure Property for Regular Languages.
Inf. Process. Lett.
Teodor Knapik, Étienne Payet
1995 J jnl
Observational Specifications and the Indistinguishability Assumption.
Theor. Comput. Sci.
Gilles Bernot, Michel Bidoit, Teodor Knapik
1994 J jnl
Behavioural Approaches to Algebraic Specifications: A Comparative Study.
Acta Informatica
Gilles Bernot, Michel Bidoit, Teodor Knapik
1992 A conf
Towards an Adequate Notion of Observation.
ESOP
Gilles Bernot, Michel Bidoit, Teodor Knapik
1991 — conf
Specifications with Observable Formulae and Observational Satisfaction Relation.
COMPASS/ADT
Teodor Knapik