Teodor Knapik Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

1Gilles Bernot [2] [3] [4]
2Michel Bidoit [2] [3] [4]
3Hugues Calbrix [6] [7]
4Didier Caucal [9] [13]
5Bruno Courcelle [11]
6Christian Delhommé [15]
7Damian Niwinski [10] [14] [16]
8Étienne Payet [5] [8]
9D. Gnanaraj Thomas [15]
10Pawel Urzyczyn [10] [14] [16]
11Igor Walukiewicz [16]

Colors in the list of coauthors

Copyright © Mon Nov 16 17:22:42 2009 by Michael Ley (ley@uni-trier.de)