scientific article

zbMath0498.68048MaRDI QIDQ3964028

Laurent Chottin

Publication date: 1982

Full work available at URL: https://eudml.org/doc/92160

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

formal languagesalgebraic languagedeterministic automatonrational languagedeterministic languagerational rewriting system

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Adding global forbidding context to context-free grammars ⋮ On rationally controlled one-rule insertion systems ⋮ Rational subsets of partially reversible monoids ⋮ Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata ⋮ Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages ⋮ Some decision problems about controlled rewriting systems ⋮ A characterisation of deterministic context-free languages by means of right-congruences ⋮ Calcul de longueurs de chaînes de réécriture dans le monoïde libre

Cites Work

• Une généralisation des ensembles de Dyck
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: