scientific article; zbMATH DE number 2053214

zbMATH Open1066.68060MaRDI QIDQ4454841FDOQ4454841

Authors: Stephen L. Bloom, Zoltán Ésik 

Publication date: 8 March 2004

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

finite automataordinal wordsregular sets of binary strings

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (9)

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