scientific article

zbMath0604.68094MaRDI QIDQ3741089

Jean-Pierre Pecuchet

Publication date: 1985

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

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

zbMATH Keywords

rational languagestwo-way automatafree inverse monoidrational setsBirget's semigroup

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (15)

Automates et codes zigzag ⋮ The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index ⋮ On $z$-submonoids and $z$-codes ⋮ Concatenation of inputs in a two-way automaton ⋮ Two-way automaton computations ⋮ On coding morphisms for zigzag codes ⋮ Two-way representations and weighted automata ⋮ Sur les codes zigzag et leur décidabilité. (Zigzag codes and their decidability) ⋮ Positional simulation of two-way automata: Proof of a conjecture of R. Kannan and generalizations ⋮ A solution of the word problem for free \(^*\)-regular semigroups ⋮ Stability for the zigzag submonoids ⋮ The zig-zag power series: A two-way version of the \({}^*\) operator. ⋮ Outils et résultats pour les transducteurs boustrophédons ⋮ Automates boustrophédon et mots infinis ⋮ On labeled birooted tree languages: algebras, automata and logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automates boustrophédon et mots infinis
• Free Inverse Semigroups
• Free Inverse Semigroups
• Time and tape complexity of pushdown automaton languages

This page was built for publication: