Works matching IS 01290541 AND DT 2019 AND VI 30 AND IP 1
Results: 9
Characterization of Infinite LSP Words and Endomorphisms Preserving the LSP Property.
- Published in:
- International Journal of Foundations of Computer Science, 2019, v. 30, n. 1, p. 171, doi. 10.1142/S0129054119400082
- By:
- Publication type:
- Article
The Generalized Rank of Trace Languages.
- Published in:
- International Journal of Foundations of Computer Science, 2019, v. 30, n. 1, p. 135, doi. 10.1142/S0129054119400070
- By:
- Publication type:
- Article
Descriptional Complexity of the Forever Operator.
- Published in:
- International Journal of Foundations of Computer Science, 2019, v. 30, n. 1, p. 115, doi. 10.1142/S0129054119400069
- By:
- Publication type:
- Article
On the Interplay Between Černý and Babai's Conjectures.
- Published in:
- International Journal of Foundations of Computer Science, 2019, v. 30, n. 1, p. 93, doi. 10.1142/S0129054119400057
- By:
- Publication type:
- Article
A Pumping Lemma for Permitting Semi-Conditional Languages.
- Published in:
- International Journal of Foundations of Computer Science, 2019, v. 30, n. 1, p. 73, doi. 10.1142/S0129054119400045
- By:
- Publication type:
- Article
On a Greedy Algorithm to Construct Universal Cycles for Permutations.
- Published in:
- International Journal of Foundations of Computer Science, 2019, v. 30, n. 1, p. 61, doi. 10.1142/S0129054119400033
- By:
- Publication type:
- Article
Lower Bounds for Synchronizing Word Lengths in Partial Automata.
- Published in:
- International Journal of Foundations of Computer Science, 2019, v. 30, n. 1, p. 29, doi. 10.1142/S0129054119400021
- By:
- Publication type:
- Article
Operational State Complexity and Decidability of Jumping Finite Automata.
- Published in:
- International Journal of Foundations of Computer Science, 2019, v. 30, n. 1, p. 5, doi. 10.1142/S012905411940001X
- By:
- Publication type:
- Article
Preface.
- Published in:
- 2019
- By:
- Publication type:
- Proceeding