The following pages link to Géraud Sénizergues (Q580991):
Displayed 50 items.
- Groups and NTS languages (Q580992) (← links)
- Some undecidable termination problems for semi-Thue systems (Q673625) (← links)
- Item:Q580991 (redirect page) (← links)
- Bottom-up rewriting for words and terms (Q741256) (← links)
- Remarques sur les langages de parenthèses (Q800094) (← links)
- Some decision problems about controlled rewriting systems (Q910246) (← links)
- A characterisation of deterministic context-free languages by means of right-congruences (Q913524) (← links)
- Item:Q580991 (redirect page) (← links)
- The equivalence and inclusion problems for NTS languages (Q1083219) (← links)
- NTS languages are deterministic and congruential (Q1083220) (← links)
- Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages (Q1120292) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q1127336) (← links)
- A new class of C.F.L. for which the equivalence is decidable (Q1162819) (← links)
- The obstructions of a minor-closed set of graphs defined by a context-free grammar (Q1379821) (← links)
- Complete formal systems for equivalence problems (Q1575907) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- \(L(A)=L(B)\)? A simplified decidability proof. (Q1603704) (← links)
- Decision problems for semi-Thue systems with a few rules (Q1763707) (← links)
- On the rational subsets of the free group (Q1924996) (← links)
- Equations over free inverse monoids with idempotent variables (Q2411041) (← links)
- Word-mappings of level 2 (Q2441544) (← links)
- Iterated pushdown automata and sequences of rational numbers (Q2498918) (← links)
- (Q3339311) (← links)
- When Is a Graph Product of Groups Virtually-Free? (Q3429307) (← links)
- Sequences of Level 1, 2, 3,..., k,... (Q3499764) (← links)
- RATIONAL SUBSETS IN HNN-EXTENSIONS AND AMALGAMATED PRODUCTS (Q3502750) (← links)
- Theories of HNN-Extensions and Amalgamated Products (Q3591452) (← links)
- Tree Automata and Automata on Linear Orderings (Q3625696) (← links)
- (Q3965569) (← links)
- (Q4218106) (← links)
- (Q4223071) (← links)
- (Q4449197) (← links)
- (Q4453459) (← links)
- (Q4529994) (← links)
- The equivalence problem for deterministic pushdown automata is decidable (Q4571996) (← links)
- An effective version of Stallings' theorem in the case of context-free groups (Q4630285) (← links)
- The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed (Q4645287) (← links)
- (Q4737142) (← links)
- (Q4818836) (← links)
- (Q4867142) (← links)
- (Q4938651) (← links)
- The isomorphism problem for finite extensions of free groups is in PSPACE (Q5002826) (← links)
- (Q5028483) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q5055831) (← links)
- On the termination problem for one-rule semi-Thue system (Q5055868) (← links)
- The Bisimulation Problem for Equational Graphs of Finite Out-Degree (Q5317186) (← links)
- LALBLC A Program Testing the Equivalence of dpda’s (Q5327493) (← links)
- EQUATIONS IN FREE INVERSE MONOIDS (Q5386970) (← links)
- (Q5389154) (← links)
- Bottom-Up Rewriting Is Inverse Recognizability Preserving (Q5432336) (← links)