|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1 occurrences of 1 keywords
|
|
|
|
|
Results
Found 17 publication records. Showing 17 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Didier Caucal, Teodor Knapik |
Higher order indexed monadic systems.  |
FSTTCS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz |
Unsafe Grammars and Panic Automata. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Delhommé, Teodor Knapik, D. Gnanaraj Thomas |
Using Transitive-Closure Logic for Deciding Linear Properties of Monoids. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
monoid presentations, transitive closure logic, string rewriting |
| 1 | Bruno Courcelle, Teodor Knapik |
The evaluation of first-order substitution is monadic second-order compatible. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Teodor Knapik |
Checking Simple Properties of Transition Systems Defined by Thue Specifications. |
J. Autom. Reasoning |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal, Teodor Knapik |
A Chomsky-Like Hierarchy of Infinite Graphs. |
MFCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Teodor Knapik, Damian Niwinski, Pawel Urzyczyn |
Higher-Order Pushdown Trees Are Easy. |
FoSSaCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal, Teodor Knapik |
An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs. |
Theory Comput. Syst. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Teodor Knapik, Damian Niwinski, Pawel Urzyczyn |
Deciding Monadic Theories of Hyperalgebraic Trees. |
TLCA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Teodor Knapik, Hugues Calbrix |
Thue Specifications and Their Monadic Second-order Properties. |
Fundam. Inform. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Teodor Knapik, Étienne Payet |
Synchronized Product of Linear Bounded Machines. |
FCT |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Teodor Knapik, Étienne Payet |
The Full Quotient and its Closure Property for Regular Languages. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Hugues Calbrix, Teodor Knapik |
A String-Rewriting Characterization of Muller and Schupp's Context-Free Graphs. |
FSTTCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Gilles Bernot, Michel Bidoit, Teodor Knapik |
Observational Specifications and the Indistinguishability Assumption. |
Theor. Comput. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Gilles Bernot, Michel Bidoit, Teodor Knapik |
Behavioural Approaches to Algebraic Specifications: A Comparative Study. |
Acta Inf. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Gilles Bernot, Michel Bidoit, Teodor Knapik |
Towards an Adequate Notion of Observation. |
ESOP |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Teodor Knapik |
Specifications with Observable Formulae and Observational Satisfaction Relation. |
COMPASS/ADT |
1991 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #17 of 17 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")