ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
A note on Nielsen reduction and coset enumeration
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Confluence problems for trace rewriting systems
Information and Computation
Journal of Automated Reasoning
Semi-Thue Systems with an Inhibitor
Journal of Automated Reasoning
Checking Simple Properties of Transition Systems Defined by Thue Specifications
Journal of Automated Reasoning
A Completion Procedure for Finitely Presented Groups That Is Based on Word Cycles
Journal of Automated Reasoning
The home marking problem and some related concepts
Acta Cybernetica
Complexity Results for Confluence Problems
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Matching Modulo Associativity and Idempotency Is NP-Complete
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Word Problems for 2-Homogeneous Monoids and Symmetric Logspace
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Undecidability Results for Monoids with Linear-Time Decidable Word Problems
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Unavoidable Configurations of Parameterized Rings of Processes
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
On Word Rewriting Systems Having a Rational Derivation
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Prefix Languages of Church-Rosser Languages
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
On the Connections between Rewriting and Formal Language Theory
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Some Regular Languages That Are Church-Rosser Congruential
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
The Family Intercom: Developing a Context-Aware Audio Communication System
UbiComp '01 Proceedings of the 3rd international conference on Ubiquitous Computing
Some Applications of the Decidability of DPDA's Equivalence
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
On the Transition Graphs of Turing Machines
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
A New Rewrite Method for Convergence of Self-Stabilizing Systems
Proceedings of the 13th International Symposium on Distributed Computing
Loops of Superexponential Lengths in One-Rule String Rewriting
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Formal and natural computing
Query containment and rewriting using views for regular path queries under constraints
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Sequence-Based Software Specification
IEEE Transactions on Software Engineering
Undecidable properties of monoids with word problem solvable in linear time
Theoretical Computer Science
McNaughton families of languages
Theoretical Computer Science
On the complexity of a problem on monadic string rewriting systems
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Decision Problems for Semi-Thue Systems with a Few Rules
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Term rewriting restricted to ground terms
Theoretical Computer Science
The context-splittable normal form for Church--Rosser language systems
Information and Computation - RTA 2001
String rewriting and homology of monoids
Mathematical Structures in Computer Science
Classes of term rewrite systems with polynomial confluence problems
ACM Transactions on Computational Logic (TOCL)
Peg-solitaire, string rewriting systems and finite automata
Theoretical Computer Science
Deleting string rewriting systems preserve regularity
Theoretical Computer Science - Developments in language theory
Decision problems for semi-Thue systems with a few rules
Theoretical Computer Science - Insightful theory
Information and Computation
Advanced Topics in Term Rewriting by Enno Ohlebusch, Springer Verlag, 2002
Journal of Functional Programming
Finite derivation type for Rees matrix semigroups
Theoretical Computer Science
Termination of {aa ⅾ bc, bb ⅾ ac, cc ⅾ ab}
Information Processing Letters
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
LARS: A learning algorithm for rewriting systems
Machine Learning
Algorithms and Reductions for Rewriting Problems
Fundamenta Informaticae
Languages generated by iterated idempotency
Theoretical Computer Science
Observation of String-Rewriting Systems
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
A geometric characterization of automatic semigroups
Theoretical Computer Science
Modeling Pointer Redirection as Cyclic Term-graph Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Journal of Computer Security - Special issue on CSFW15
Unification and Matching Modulo Leaf-Permutative Equational Presentations
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
On Regularity-Preservation by String-Rewriting Systems
Language and Automata Theory and Applications
Polycyclic and Bicyclic Valence Automata
Language and Automata Theory and Applications
Rational subsets of partially reversible monoids
Theoretical Computer Science
How to make biological systems compute: simply observe them
Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Canonical Reduction Systems in Symbolic Mathematics
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Rational subsets of polycyclic monoids and valence automata
Information and Computation
Church-Rosser groups and growing context-sensitive groups
Journal of Automata, Languages and Combinatorics
Information and Computation
Termination of {aa →bc,bb→ac,cc→ab}
Information Processing Letters
Security analysis of word problem-based cryptosystems
Designs, Codes and Cryptography
Restarting automata and their relations to the Chomsky hierarchy
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Deleting string rewriting systems preserve regularity
DLT'03 Proceedings of the 7th international conference on Developments in language theory
A rewriting alternative to Reidemeister-Schreier
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
On s-regular preffix-rewriting systems and automatic structures
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Generalizable safety annotations for specification of failure patterns
Software—Practice & Experience
Algorithms and theory of computation handbook
Computing by observing: Simple systems and simple observers
Theoretical Computer Science
Infinite families of finite string rewriting systems and their confluence
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Information and Computation
A saturation method for the modal μ-calculus over pushdown systems
Information and Computation
On properties not inherited by monoids from their Schützenberger groups
Information and Computation
Regularity and context-freeness over word rewriting systems
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Weighted automata for proving termination of string rewriting
Journal of Automata, Languages and Combinatorics
Compressed membership in automata with compressed labels
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Identification in the limit of substitutable context-free languages
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Completion attacks and weak keys of oleshchuk’s public key cryptosystem
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Algebraic characterization of the finite power property
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Termination of single-threaded one-rule semi-thue systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Finding finite automata that certify termination of string rewriting
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Decidability and complexity in automatic monoids
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Termination of string rewriting with matrix interpretations
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Closure of language classes under bounded duplication
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
The derivational complexity of string rewriting systems
Theoretical Computer Science
Logspace computations in graph groups and coxeter groups
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Regular languages are church-rosser congruential
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Growing Grammars and Length-reducing Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
nuTAB-BackSpace: rewriting to normalize non-determinism in post-silicon debug traces
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Groups and automata: a perfect match
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Observation of String-Rewriting Systems
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Algorithms and Reductions for Rewriting Problems
Fundamenta Informaticae
Thue Specifications and Their Monadic Second-order Properties
Fundamenta Informaticae
Some Undecidability Results For Finitely Generated Thue Congruences On A Two-Letter Alphabet
Fundamenta Informaticae
Graph transformation with focus on incident edges
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
On The Diversity Of Orderings On Strings
Fundamenta Informaticae
FASE'13 Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering
Silent transitions in automata with storage
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Some decision problems concerning NPDAs, palindromes, and dyck languages
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Lambda-Confluence is undecidable for clearing restarting automata
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Theory of Computing Systems
Applying string-rewriting to sequence-based specification
Formal Methods in System Design
| Hi-index | 0.01 |