Iterators for sequence expressions

DOI10.1007/BF02575596MaRDI QIDQ794178zbMATH OpenOpenAlexFDO

Authors P. Ercoli

Publication date 1983

Published in Calcolo (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02575596

zbMATH Keywords

Finite iterationsformal languagesrational operationsregular expressionsshuffle products

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Review text

Finite iterations and shuffle products are well-known operations and may be used for concise descriptions of formal languages. This paper gives a collection of formulas which are useful in computations involving these operations along with other rational operations (union, concatenation, Kleene star).

Recommendations

• Expressions of pattern sequences
• Iterating transducers
• Iterating transducers
• Iterating transducers
• Iterating along a Prikry sequence
• Iterator Types
• scientific article; zbMATH DE number 1539439
• scientific article; zbMATH DE number 4030122
• scientific article; zbMATH DE number 3934316

Cites work

• Hardware Algorithms for Nonnumeric Computation
• scientific article; zbMATH DE number 3725684 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• Mappings of languages by two-tape devices

Cited in

(3)

• Iterating along a Prikry sequence
• The essence of the <scp>Iterator</scp> pattern
• scientific article; zbMATH DE number 718638 (Why is no real title available?)

This page was built for publication: Iterators for sequence expressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794178)