scientific article; zbMATH DE number 2053214

zbMATH Open1066.68060MaRDI QIDQ4454841FDOQ4454841

Authors Stephen L. Bloom, Zoltán Ésik

Publication date 8 March 2004

zbMATH Keywords

finite automataordinal wordsregular sets of binary strings

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Tree-automatic scattered linear orders
• Word automaticity of tree automatic scattered linear orderings is decidable
• On frontiers of regular trees
• Isomorphism of regular trees and words
• Isomorphism of regular trees and words

Cited in

(9)

• Isomorphism of regular trees and words
• The ordinal generated by an ordinal grammar is computable
• A Mezei-Wright theorem for categorical algebras
• Büchi context-free languages
• On Müller context-free grammars
• The equational theory of regular words
• On frontiers of regular trees
• A note on ordinal DFAs
• Axiomatizing omega and omega-op powers of words

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