Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable

@article{Huschenbett2012WordAO,
  title={Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable},
  author={Martin Huschenbett},
  journal={ArXiv},
  year={2012},
  volume={abs/1201.5070}
}
  • Martin Huschenbett
  • Published 2012
  • Computer Science, Mathematics
  • ArXiv
  • A tree automatic structure is a structure whose domain can be encoded by a regular tree language such that each relation is recognisable by a finite automaton processing tuples of trees synchronously. Words can be regarded as specific simple trees and a structure is word automatic if it is encodable using only these trees. The question naturally arises whether a given tree automatic structure is already word automatic. We prove that this problem is decidable for tree automatic scattered linear… CONTINUE READING

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-5 OF 5 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 12 REFERENCES

    On automatic partial orders

    Automatic structures

    • Achim Blumensath, E. Grädel
    • Computer Science
    • Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)
    • 2000
    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Languages, Automata, and Logic

    • Wolfgang Thomas
    • Mathematics, Computer Science
    • Handbook of Formal Languages
    • 1997

    Tree Languages

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Automatic presentations of structures. In: LCC 1994

    • B Khoussainov, A Nerode
    • LNCS
    • 1995

    Automatic structures. Diploma thesis

    • A Blumensath
    • RWTH Aachen
    • 1999