scientific article; zbMATH DE number 3947646

MaRDI QIDQ3718174zbMATH OpenFDO

Authors M. Nivat, Dominique Perrin

Publication date 1986

zbMATH Keywords

deterministic automatarecognizability by a finite automatontwo sided infinite words

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Ensembles Reconnaissables de Mots Biinfinis
• scientific article; zbMATH DE number 3992940
• scientific article; zbMATH DE number 3917744
• Codeterministic automata on infinite words
• Mathematical Foundations of Computer Science 2003

Cited in

(15)

• Codeterministic automata on infinite words
• First-order logic and star-free sets
• On automata recognizing birecurrent sets
• Sets of Infinite Words Recognized by Deterministic One-Turn Pushdown Automata
• scientific article; zbMATH DE number 3911750 (Why is no real title available?)
• scientific article; zbMATH DE number 3917744 (Why is no real title available?)
• scientific article; zbMATH DE number 3924161 (Why is no real title available?)
• Continuous monoids and yields of infinite trees
• Ensembles Reconnaissables de Mots Biinfinis
• Finitary codes for biinfinite words
• scientific article; zbMATH DE number 3992940 (Why is no real title available?)
• scientific article; zbMATH DE number 4121455 (Why is no real title available?)
• scientific article; zbMATH DE number 222345 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2003
• Bilimites de langages reconnaissables

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 Q3718174)