scientific article; zbMATH DE number 2086415

MaRDI QIDQ4736870zbMATH OpenFDO

Authors Marie-Pierre Béal, Dominique Perrin

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2285/22850547.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics in computer science (68R05)

Recommendations

• On the generating sequences of regular languages on \(k\) symbols
• scientific article; zbMATH DE number 1261119
• Efficient Enumeration of Regular Languages
• Enumerating the strings of regular languages
• On some questions regarding \(k\)-regular and \(k\)-context-free sequences
• On characterizations of recursively enumerable languages
• scientific article; zbMATH DE number 3934415
• Publication:4941145
• Generalization of automatic sequences for numeration systems on a regular language
• On the semigroup languages and the regular languages

Cited in

(6)

• Enumerating regular expressions and their languages
• scientific article; zbMATH DE number 1577991 (Why is no real title available?)
• scientific article; zbMATH DE number 1714668 (Why is no real title available?)
• On the generating sequences of regular languages on \(k\) symbols
• Application of logic to integer sequences: a survey
• On String Languages Generated by Sequential Numerical P Systems

This page was built for publication:

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