Confluence problems for trace rewriting systems
Information and Computation
Resource traces: a domain for processes sharing exclusive resources
Theoretical Computer Science
An Improvement of McMillan's Unfolding Algorithm
Formal Methods in System Design
Complexity Results for Confluence Problems
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Generalized Regular Counting Classes
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Solvability of Equations in Free Partially Commutative Groups Is Decidable
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On the Theory of One-Step Rewriting in Trace Monoids
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Modeling Interaction by Sheaves and Geometric Logic
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Divisibility Monoids: Presentation, Word Problem, and Rational Languages
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Regular sets of infinite message sequence charts
Information and Computation
Keeping track of the latest gossip in a distributed system
Distributed Computing
Two optimal parallel algorithms on the commutation class of a word
Theoretical Computer Science - Words, languages and combinatorics
Algebraic recognizability of regular tree languages
Theoretical Computer Science - The art of theory
Fundamenta Informaticae
Shuffle of Words and Araucaria Trees
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Weighted asynchronous cellular automata
Theoretical Computer Science
On Ethics of Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Sheaves and Geometric Logic and Applications to Modular Verification of Complex Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Generating series of the trace group
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Some undecidability results related to the star problem in trace monoids
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Compressed conjugacy and the word problem for outer automorphism groups of graph groups
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Infinite Product of Traces Represented by Projections
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Symbolic dynamics, flower automata and infinite traces
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Weighted asynchronous cellular automata
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Partially commutative inverse monoids
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On the minimal automaton of the shuffle of words and araucarias
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Logspace computations in graph groups and coxeter groups
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Proceedings of the Third Symposium on Information and Communication Technology
Infinite Traces and Symbolic Dynamics - the Minimal Shift Case
Fundamenta Informaticae
On Ethics of Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Fundamenta Informaticae
Shuffle of Words and Araucaria Trees
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
A Note on the Logical Definability of Rational Trace Languages
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Efficient computation in groups via compression
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
A Novel Formalism for Partially Defined Asynchronous Feedback Digital Circuits
Journal of Electronic Testing: Theory and Applications
| Hi-index | 0.00 |