The following pages link to Jean-Camille Birget (Q766115):
Displayed 50 items.
- (Q198221) (redirect page) (← links)
- (Q666697) (redirect page) (← links)
- Inverse monoids associated with the complexity class NP (Q666698) (← links)
- Partial orders on words, minimal elements of regular languages, and state complexity (Q688156) (← links)
- Monoids that map onto the Thompson-Higman groups (Q766116) (← links)
- Bernoulli measure on strings, and Thompson-Higman monoids. (Q766121) (← links)
- Almost finite expansions of arbitrary semigroups (Q798447) (← links)
- Iteration of expansions. Unambiguous semigroups (Q798782) (← links)
- Arbitrary vs. regular semigroups (Q798783) (← links)
- Monoid generalizations of the Richard Thompson groups. (Q958127) (← links)
- One-way permutations, computational asymmetry and distortion. (Q959774) (← links)
- The synthesis theorem for finite regular semigroups, and its generalization (Q1110661) (← links)
- Concatenation of inputs in a two-way automaton (Q1115636) (← links)
- Group theory via global semigroup theory (Q1118042) (← links)
- Circuits over monoids: A fault model, and a trade-off between testability and circuit delay (Q1195687) (← links)
- Intersection and union of regular languages and state complexity (Q1199879) (← links)
- Positional simulation of two-way automata: Proof of a conjecture of R. Kannan and generalizations (Q1201150) (← links)
- Infinite string rewrite systems and complexity (Q1264463) (← links)
- The word problem of inverse monoids presented by one idempotent relator (Q1314383) (← links)
- Formal languages defined by uniform substitutions (Q1334665) (← links)
- Reductions and functors from problems to word problems (Q1566706) (← links)
- \texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata (Q1575552) (← links)
- A complete rewrite system and normal forms for \((S)_{\text{reg}}\) (Q1849635) (← links)
- Isoperimetric and isodiametric functions of groups (Q1851484) (← links)
- Isoperimetric functions of groups and computational complexity of the word problem (Q1851485) (← links)
- The word problem of the Brin-Thompson group is \textsf{coNP}-complete (Q2306657) (← links)
- The state complexity of \(\overline{\varSigma ^*\overline{L}}\) and its connection with temporal logic (Q2423779) (← links)
- Two-letter group codes that preserve aperiodicity of inverse finite automata. (Q2480773) (← links)
- THE THOMPSON–HIGMAN MONOIDS M<sub>k,i</sub>: THE ${\mathcal J}$-ORDER, THE ${\mathcal D}$-RELATION, AND THEIR COMPLEXITY (Q2996837) (← links)
- Semigroups whose idempotents form a subsemigroup (Q3033981) (← links)
- (Q3212295) (← links)
- ON THE CIRCUIT-SIZE OF INVERSES (Q3224957) (← links)
- STRICT LOCAL TESTABILITY OF THE FINITE CONTROL OF TWO-WAY AUTOMATA AND OF REGULAR PICTURE DESCRIPTION LANGUAGES (Q3361892) (← links)
- (Q3421471) (← links)
- Two-way automaton computations (Q3479524) (← links)
- FACTORIZATIONS OF THE THOMPSON–HIGMAN GROUPS, AND CIRCUIT COMPLEXITY (Q3520362) (← links)
- Deviation bounds for wavelet shrinkage (Q3547043) (← links)
- THE ${\mathcal R}$- AND ${\mathcal L}$-ORDERS OF THE THOMPSON–HIGMAN MONOID M<sub>k, 1</sub> AND THEIR COMPLEXITY (Q3580222) (← links)
- (Q3677933) (← links)
- (Q3759045) (← links)
- Stability and J-depth of expansions (Q3778927) (← links)
- (Q4271214) (← links)
- Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem (Q4354236) (← links)
- ON THE WORD PROBLEM FOR TENSOR PRODUCTS AND AMALGAMS OF MONOIDS (Q4513298) (← links)
- PSPACE-completeness of certain algorithmic problems on the subgroups of free groups (Q4632433) (← links)
- THE GROUPS OF RICHARD THOMPSON AND COMPLEXITY (Q4658702) (← links)
- Polynomial-time right-ideal morphisms and congruences (Q4686444) (← links)
- FUNCTIONS ON GROUPS AND COMPUTATIONAL COMPLEXITY (Q4824696) (← links)
- Two-way automata and length-preserving homomorphisms (Q4879206) (← links)
- The symmetric Post Correspondence Problem, and errata for the freeness problem for matrix semigroups (Q5097713) (← links)