共 50 条
- [42] The Parameterized Complexity of Chosen Problems for Finite Automata on Trees LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2011, 6638 : 129 - +
- [45] Probabilistic Automata on Finite Words: Decidable and Undecidable Problems AUTOMATA, LANGUAGES AND PROGRAMMING, PT II, 2010, 6199 : 527 - +
- [47] SOME PROBLEMS OF CONSTRUCTIVE THEORIES OF FINITE STOCHASTIC AUTOMATA ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1968, 14 (05): : 413 - &