scientific article

zbMath0512.68063MaRDI QIDQ3657457

Jacques Sakarovitch

Publication date: 1983

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

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

zbMATH Keywords

cross section theoremrational cross section

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

The State Complexity of Lexicographically Smallest Words and Computing Successors ⋮ Crossability of cancellative Kleene semigroups ⋮ On the sequentiality of the successor function ⋮ Numeration systems, linear recurrences, and regular sets ⋮ Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages ⋮ On the representation of finite deterministic 2-tape automata ⋮ Language-theoretic problems arising from Richelieu cryptosystems ⋮ Radix enumeration of rational languages

Cites Work

• A new proof of two theorems about rational transductions
• Classification of formal languages by functional binary transductions
• Unnamed Item
• Unnamed Item
• Unnamed Item