default search action
Teodor Knapik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i3]Teodor Knapik, Adolphe Ratiarison, Hasina Razafindralambo:
An experimental evaluation of choices of SSA forecasting parameters. CoRR abs/2403.16507 (2024) - [i2]Teodor Knapik:
Lindenmayer graph languages, first-order theories and expanders. CoRR abs/2405.17629 (2024) - 2021
- [i1]Teodor Knapik:
Signal automata and hidden Markov models. CoRR abs/2105.01341 (2021)
2010 – 2019
- 2018
- [j8]Didier Caucal, Teodor Knapik:
Shelah-Stupp's Iteration and Muchnik's Iteration. Fundam. Informaticae 159(4): 327-359 (2018) - 2013
- [c11]Meenakshi D'Souza, Teodor Knapik:
Verification of Message Sequence Structures. ICDCIT 2013: 171-182 - 2011
- [c10]Didier Caucal, Teodor Knapik:
Higher order indexed monadic systems. FSTTCS 2011: 469-480
2000 – 2009
- 2005
- [c9]Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz:
Unsafe Grammars and Panic Automata. ICALP 2005: 1450-1461 - 2003
- [c8]Christian Delhommé, Teodor Knapik, D. Gnanaraj Thomas:
Using Transitive-Closure Logic for Deciding Linear Properties of Monoids. MFCS 2003: 378-387 - 2002
- [j7]Teodor Knapik:
Checking Simple Properties of Transition Systems Defined by Thue Specifications. J. Autom. Reason. 28(5): 337-369 (2002) - [j6]Bruno Courcelle, Teodor Knapik:
The evaluation of first-order substitution is monadic second-order compatible. Theor. Comput. Sci. 281(1-2): 177-206 (2002) - [c7]Teodor Knapik, Damian Niwinski, Pawel Urzyczyn:
Higher-Order Pushdown Trees Are Easy. FoSSaCS 2002: 205-222 - [c6]Didier Caucal, Teodor Knapik:
A Chomsky-Like Hierarchy of Infinite Graphs. MFCS 2002: 177-187 - 2001
- [j5]Didier Caucal, Teodor Knapik:
An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs. Theory Comput. Syst. 34(4): 299-336 (2001) - [c5]Teodor Knapik, Damian Niwinski, Pawel Urzyczyn:
Deciding Monadic Theories of Hyperalgebraic Trees. TLCA 2001: 253-267
1990 – 1999
- 1999
- [j4]Teodor Knapik, Hugues Calbrix:
Thue Specifications and Their Monadic Second-order Properties. Fundam. Informaticae 39(3): 305-325 (1999) - [c4]Teodor Knapik, Étienne Payet:
Synchronized Product of Linear Bounded Machines. FCT 1999: 362-373 - 1998
- [j3]Teodor Knapik, Étienne Payet:
The Full Quotient and its Closure Property for Regular Languages. Inf. Process. Lett. 65(2): 57-62 (1998) - [c3]Hugues Calbrix, Teodor Knapik:
A String-Rewriting Characterization of Muller and Schupp's Context-Free Graphs. FSTTCS 1998: 331-342 - 1995
- [j2]Gilles Bernot, Michel Bidoit, Teodor Knapik:
Observational Specifications and the Indistinguishability Assumption. Theor. Comput. Sci. 139(1&2): 275-314 (1995) - 1994
- [j1]Gilles Bernot, Michel Bidoit, Teodor Knapik:
Behavioural Approaches to Algebraic Specifications: A Comparative Study. Acta Informatica 31(7): 651-671 (1994) - 1992
- [c2]Gilles Bernot, Michel Bidoit, Teodor Knapik:
Towards an Adequate Notion of Observation. ESOP 1992: 39-55 - 1991
- [c1]Teodor Knapik:
Specifications with Observable Formulae and Observational Satisfaction Relation. COMPASS/ADT 1991: 271-291
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint