Pages that link to "Item:Q2789506"
From MaRDI portal
The following pages link to Electronic Proceedings in Theoretical Computer Science (Q2789506):
Displaying 50 items.
- Interactions between Digital Geometry and Combinatorics on Words (Q2789507) (← links)
- Infinite permutations vs. infinite words (Q2789508) (← links)
- Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions (Q2789509) (← links)
- Circular words and applications (Q2789510) (← links)
- Finite-Repetition threshold for infinite ternary words (Q2789511) (← links)
- Uniformly balanced words with linear complexity and prescribed letter frequencies (Q2789512) (← links)
- Pattern 1^j0^i avoiding binary words (Q2789513) (← links)
- Pattern Avoidability with Involution (Q2789515) (← links)
- Recurrent Partial Words (Q2789516) (← links)
- Monoids and Maximal Codes (Q2789517) (← links)
- Bounded Parikh Automata (Q2789518) (← links)
- From Regular to Strictly Locally Testable Languages (Q2789519) (← links)
- Substitutions over infinite alphabet generating (−β)-integers (Q2789521) (← links)
- A Classification of Trapezoidal Words (Q2789522) (← links)
- On Pansiot Words Avoiding 3-Repetitions (Q2789523) (← links)
- A new proof for the decidability of D0L ultimate periodicity (Q2789524) (← links)
- The complexity of tangent words (Q2789525) (← links)
- Unambiguous 1-Uniform Morphisms (Q2789526) (← links)
- Constructing Premaximal Binary Cube-free Words of Any Level (Q2789527) (← links)
- Fife's Theorem for (7/3)-Powers (Q2789528) (← links)
- Information theory: Sources, Dirichlet series, and realistic analyses of data structures (Q2789530) (← links)
- Systems of Word Equations and Polynomials: a New Approach (Q2789531) (← links)
- Word posets, with applications to Coxeter groups (Q2789532) (← links)
- The Critical Exponent is Computable for Automatic Sequences (Q2789533) (← links)
- Optimizing Properties of Balanced Words (Q2789534) (← links)
- On the Delone property of (−β)-integers (Q2789535) (← links)
- Permutation complexity of the fixed points of some uniform binary morphisms (Q2789536) (← links)
- Permutation Complexity Related to the Letter Doubling Map (Q2789537) (← links)
- (Q3174657) (← links)
- Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems (Q3174658) (← links)
- (Q3174659) (← links)
- Proceedings Sixth Workshop on Structural Operational Semantics (Q3174660) (← links)
- Proceedings Seventh International Conference on Computability and Complexity in Analysis (Q3174661) (← links)
- (Q3174662) (← links)
- Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems (Q3174681) (← links)
- Proceedings Seventh Workshop on Structural Operational Semantics (Q3174682) (← links)
- Proceedings Third International Workshop on Classical Logic and Computation (Q3174683) (← links)
- (Q3174684) (← links)
- Proceedings of Second International Symposium on Games, Automata, Logics and Formal Verification (Q3174685) (← links)
- (Q3174686) (← links)
- Proceedings 13th International Workshop on Verification of Infinite-State Systems (Q3174687) (← links)
- (Q3174688) (← links)
- Proceedings 18th international workshop on Cellular Automata and Discrete Complex Systems and 3rd international symposium Journées Automates Cellulaires (Q3174689) (← links)
- (Q3174690) (← links)
- (Q3174691) (← links)
- Proceedings Fourth Workshop on Classical Logic and Computation (Q3174692) (← links)
- (Q3296528) (← links)
- (Q3296529) (← links)
- (Q3296530) (← links)
- Proceedings Sixth Workshop on Developments in Computational Models: Causality, Computation, and Physics (Q3299825) (← links)