Test sets for languages of infinite words

DOI10.1016/0020-0190(88)90035-XzbMath0661.68068OpenAlexW1989792946MaRDI QIDQ1113683

Mariacristina Pelagalli, Stefano Varricchio, Aldo De Luca

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90035-x

zbMATH Keywords

infinite wordword equationtest setEhrenfeucht conjecture\(\infty \)-languages

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (2)

A compactness property of the \(k\)-abelian monoids ⋮ Stefano Varricchio (1960-2008)

Cites Work

• Unnamed Item
• A proof of Ehrenfeucht's conjecture
• Adherences of languages
• Equivalence problems for mappings on infinite strings

This page was built for publication: Test sets for languages of infinite words