Decidability of Reachability Problems for Classes of Two Counters Automata
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
The finite power property in free groups
Theoretical Computer Science
On the complexity of Simon automata over the Dyck language
Journal of Automata, Languages and Combinatorics
Bottom-up rewriting is inverse recognizability preserving
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Decidability of geometricity of regular languages
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Hi-index | 0.89 |