Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability
Proceedings 12th International Workshop on Verification of Infinite-State Systems
Proceedings 8th International Conference Words 2011
Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems
Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems
Pseudo-Power Avoidance
Pseudorandom Generators against CFL/n
Pumping lemmas for linear and nonlinear context-free languages
Pushing undecidability of the isolation problem for probabilistic automata
Qualitative Concurrent Stochastic Games with Imperfect Information
Quantitative Languages Defined by Functional Automata
Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages
Quotient Complexities of Atoms of Regular Languages
Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages
Quotient Complexity of Closed Languages
Quotient complexity of ideal languages
Quotient Complexity of Regular Languages
Quotient Complexity of Star-Free Languages
Random Context and Semi-Conditional Insertion-Deletion Systems
Rankers over Infinite Words