Pages that link to "Item:Q2720405"
From MaRDI portal
The following pages link to RAIRO - Theoretical Informatics and Applications (Q2720405):
Displayed 50 items.
- Equivalences and Congruences on Infinite Conway Games (Q2889179) (← links)
- A graphical representation of relational formulae with complementation (Q2889180) (← links)
- Easy lambda-terms are not always simple (Q2889181) (← links)
- On the size of transducers for bidirectional decoding of prefix codes (Q2889182) (← links)
- Job shop scheduling with unit length tasks (Q2905324) (← links)
- Linear spans of optimal sets of frequency hopping sequences (Q2905325) (← links)
- On the decidability of semigroup freeness (Q2905326) (← links)
- On the joint 2-adic complexity of binary multisequences (Q2905327) (← links)
- Probabilistic operational semantics for the lambda calculus (Q2905328) (← links)
- Undecidability of infinite post correspondence problem for instances of size 8 (Q2905329) (← links)
- On abelian versions of critical factorization theorem (Q2911422) (← links)
- Fewest repetitions in infinite binary words (Q2911423) (← links)
- An aperiodicity problem for multiwords (Q2911425) (← links)
- Multi-dimensional sets recognizable in all abstract numeration systems (Q2911426) (← links)
- Three complexity functions (Q2911427) (← links)
- On automatic infinite permutations (Q2911428) (← links)
- Rational base number systems for<i>p</i>-adic numbers (Q2911429) (← links)
- Morphisms preserving the set of words coding three interval exchange (Q2911430) (← links)
- Repetition thresholds for subdivided graphs and trees (Q2911431) (← links)
- On the product of balanced sequences (Q2911432) (← links)
- On Abelian repetition threshold (Q2911433) (← links)
- Fixed points of endomorphisms of certain free products (Q2911434) (← links)
- On the structure of (−<i>β</i>)-integers (Q2911435) (← links)
- Binary patterns in binary cube-free words: Avoidability and growth (Q2934274) (← links)
- Bouquets of circles for lamination languages and complexities (Q2934275) (← links)
- Finite repetition threshold for large alphabets (Q2934276) (← links)
- Tree algebra of sofic tree languages (Q2934277) (← links)
- The number of binary rotation words (Q2934278) (← links)
- 5-Abelian cubes are avoidable on binary alphabets (Q2934279) (← links)
- Computing Depths of Patterns (Q2953688) (← links)
- The average lower reinforcement number of a graph (Q2953689) (← links)
- Delay Games with WMSO+U Winning Conditions (Q2953690) (← links)
- Note on occurrences of factors in circular words (Q2953691) (← links)
- Advice complexity of disjoint path allocation (Q2953693) (← links)
- Traceable Identity-Based Group Signature (Q2956880) (← links)
- Parameterized exact and approximation algorithms for maximum<i>k</i>-set cover and related satisfiability problems (Q2956881) (← links)
- A novel image encryption algorithm based on the extracted map of overlapping paths from the secret key (Q2956883) (← links)
- Kleene closure and state complexity (Q2956884) (← links)
- The average scattering number of graphs (Q2956887) (← links)
- Preface: Non-Classical Models of Automata and Applications VII (Q2969979) (← links)
- Input- or output-unary sweeping transducers are weaker than their 2-way counterparts (Q2969980) (← links)
- A pumping lemma for flip-pushdown languages (Q2969981) (← links)
- When input-driven pushdown automata meet reversiblity (Q2969982) (← links)
- Two-way representations and weighted automata (Q2969983) (← links)
- Some classes of rational functions for pictures (Q2969984) (← links)
- Homing vector automata (Q2969985) (← links)
- Quantum coherent spaces and linear logic (Q2998726) (← links)
- Sturmian jungle (or garden?) on multiliteral alphabets (Q2998727) (← links)
- Classes of two-dimensional languages and recognizability conditions (Q2998728) (← links)
- The code problem for directed figures (Q2998729) (← links)