Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
Journal of Symbolic Computation
Complete sequential specification allows for concurrent execution
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
A simple realization of a parallel device recognizing regular trace languages
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Solving puzzles related to permutation groups
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Semigroup techniques in recursive query optimization
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Journal of Symbolic Computation
Test Sets for the Universal and Existential Closure of Regular Tree Languages
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Characterization results for time-varying codes
Fundamenta Informaticae
Ensembles reconnaissables de mots biinfinis
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On congruences of automata defined by directed graphs
Theoretical Computer Science
Arithmetical complexity of symmetric D0L words
Theoretical Computer Science
Isomorphisms of generic recursive polynomial types
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Representations of Regular Ideals in Finite Automata
Cybernetics and Systems Analysis
On factorization forests of finite height
Theoretical Computer Science
On the Canonical Version of a Theorem in Ramsey Theory
Combinatorics, Probability and Computing
On the Height of a Finite Automaton
Cybernetics and Systems Analysis
Quasi-star-free languages on infinite words
Acta Cybernetica
A geometric characterization of automatic semigroups
Theoretical Computer Science
An algorithmic approach to the problem of a semiretract base
Theoretical Computer Science
Relatively regular languages and thin codes
European Journal of Combinatorics
Automata with finite congruence lattices
Acta Cybernetica
Automation and Remote Control
Weighted automata with discounting
Information Processing Letters
Theoretical Computer Science
Factorization forests for infinite words and applications to countable scattered linear orderings
Theoretical Computer Science
Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
A polynomial time algorithm for left [right] local testability
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Generating series of the trace group
DLT'03 Proceedings of the 7th international conference on Developments in language theory
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
On properties not inherited by monoids from their Schützenberger groups
Information and Computation
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Biomolecular immune-computer: theoretical basis and experimental simulator
ICARIS'05 Proceedings of the 4th international conference on Artificial Immune Systems
Recent results on syntactic groups of prefix codes
European Journal of Combinatorics
A quadratic algorithm for testing of omega-codes
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part I
Groups and decompositions of codes
Theoretical Computer Science
Deciding the Value 1 Problem for Probabilistic Leaktight Automata
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Semigroups with a context-free word problem
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Non-erasing variants of the Chomsky---Schützenberger theorem
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Characterization Results for Time-Varying Codes
Fundamenta Informaticae
Factorisation forests for infinite words application to countable scattered linear orderings
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Homotopy bases and finite derivation type for Schützenberger groups of monoids
Journal of Symbolic Computation
Iterated periodicity over finite aperiodic semigroups
European Journal of Combinatorics
Journal of Automated Reasoning
| Hi-index | 0.02 |