共 50 条
- [2] Classifying Recognizable Infinitary Trace Languages Using Word Automata MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2014, PT I, 2014, 8634 : 171 - 182
- [4] ASYNCHRONOUS AUTOMATA AND ASYNCHRONOUS LANGUAGES INFORMATION AND CONTROL, 1974, 24 (02): : 122 - 143
- [5] Asynchronous automata-theoretic characterization of aperiodic trace languages FSTTCS 2004: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 2004, 3328 : 84 - 96
- [6] Asynchronous automata-theoretic characterization of aperiodic trace languages Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004, 3328 : 84 - 96
- [7] Languages recognizable by quantum finite automata IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2006, 3845 : 1 - 14
- [9] On recognizable stable trace languages FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, 2000, 1784 : 177 - 191
- [10] Subclasses of recognizable trace languages APPLICATION AND THEORY OF PETRI NETS 1995, 1995, 935 : 357 - 373