# Teodor Knapik

According to our database

Collaborative distances:

^{1}, Teodor Knapik authored at least 19 papers between 1991 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Shelah-Stupp's Iteration and Muchnik's Iteration.

Fundam. Inform., 2018

2013

Verification of Message Sequence Structures.

Proceedings of the Distributed Computing and Internet Technology, 2013

2011

Higher order indexed monadic systems.

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2005

Unsafe Grammars and Panic Automata.

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2003

Using Transitive-Closure Logic for Deciding Linear Properties of Monoids.

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002

The evaluation of first-order substitution is monadic second-order compatible.

Theor. Comput. Sci., 2002

Checking Simple Properties of Transition Systems Defined by Thue Specifications.

J. Autom. Reasoning, 2002

A Chomsky-Like Hierarchy of Infinite Graphs.

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Higher-Order Pushdown Trees Are Easy.

Proceedings of the Foundations of Software Science and Computation Structures, 2002

2001

An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs.

Theory Comput. Syst., 2001

Deciding Monadic Theories of Hyperalgebraic Trees.

Proceedings of the Typed Lambda Calculi and Applications, 5th International Conference, 2001

1999

Thue Specifications and Their Monadic Second-order Properties.

Fundam. Inform., 1999

Synchronized Product of Linear Bounded Machines.

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998

The Full Quotient and its Closure Property for Regular Languages.

Inf. Process. Lett., 1998

A String-Rewriting Characterization of Muller and Schupp's Context-Free Graphs.

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

1995

Observational Specifications and the Indistinguishability Assumption.

Theor. Comput. Sci., 1995

1994

Behavioural Approaches to Algebraic Specifications: A Comparative Study.

Acta Inf., 1994

1992

Towards an Adequate Notion of Observation.

Proceedings of the ESOP '92, 1992

1991

Specifications with Observable Formulae and Observational Satisfaction Relation.

Proceedings of the Recent Trends in Data Type Specification, 1991