The SCEAS System
Navigation Menu

Search the dblp DataBase


Teodor Knapik: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Teodor Knapik
    Specifications with Observable Formulae and Observational Satisfaction Relation. [Citation Graph (0, 0)][DBLP]
    COMPASS/ADT, 1991, pp:271-291 [Conf]
  2. Gilles Bernot, Michel Bidoit, Teodor Knapik
    Towards an Adequate Notion of Observation. [Citation Graph (0, 0)][DBLP]
    ESOP, 1992, pp:39-55 [Conf]
  3. Teodor Knapik, Étienne Payet
    Synchronized Product of Linear Bounded Machines. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:362-373 [Conf]
  4. Teodor Knapik, Damian Niwinski, Pawel Urzyczyn
    Higher-Order Pushdown Trees Are Easy. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:205-222 [Conf]
  5. Hugues Calbrix, Teodor Knapik
    A String-Rewriting Characterization of Muller and Schupp's Context-Free Graphs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:331-342 [Conf]
  6. Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz
    Unsafe Grammars and Panic Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1450-1461 [Conf]
  7. Didier Caucal, Teodor Knapik
    A Chomsky-Like Hierarchy of Infinite Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:177-187 [Conf]
  8. Christian Delhommé, Teodor Knapik, D. Gnanaraj Thomas
    Using Transitive-Closure Logic for Deciding Linear Properties of Monoids. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:378-387 [Conf]
  9. Teodor Knapik, Damian Niwinski, Pawel Urzyczyn
    Deciding Monadic Theories of Hyperalgebraic Trees. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:253-267 [Conf]
  10. Gilles Bernot, Michel Bidoit, Teodor Knapik
    Behavioural Approaches to Algebraic Specifications: A Comparative Study. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1994, v:31, n:7, pp:651-671 [Journal]
  11. Teodor Knapik, Hugues Calbrix
    Thue Specifications and Their Monadic Second-order Properties. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:39, n:3, pp:305-325 [Journal]
  12. Teodor Knapik, Étienne Payet
    The Full Quotient and its Closure Property for Regular Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:2, pp:57-62 [Journal]
  13. Teodor Knapik
    Checking Simple Properties of Transition Systems Defined by Thue Specifications. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2002, v:28, n:5, pp:337-369 [Journal]
  14. Didier Caucal, Teodor Knapik
    An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2001, v:34, n:4, pp:299-336 [Journal]
  15. Gilles Bernot, Michel Bidoit, Teodor Knapik
    Observational Specifications and the Indistinguishability Assumption. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:139, n:1&2, pp:275-314 [Journal]
  16. Bruno Courcelle, Teodor Knapik
    The evaluation of first-order substitution is monadic second-order compatible. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:177-206 [Journal]

Search in 0.015secs, Finished in 0.016secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002