共 50 条
- [31] Automata and logics for words and trees over an infinite alphabet COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2006, 4207 : 41 - 57
- [32] Probabilistic Automata on Infinite Words: Decidability and Undecidability Results AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, 2010, 6252 : 1 - 16
- [34] Soliton cellular automata associated with infinite reduced words ANNALES DE L INSTITUT HENRI POINCARE D, 2020, 7 (02): : 249 - 302
- [35] Decision Problems for Deterministic Pushdown Automata on Infinite Words ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2014, (151): : 55 - 73
- [37] Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II, 2015, 9135 : 222 - 233
- [38] Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2009, (03): : 3 - 16