skip to main content
research-article

Automata Column

Published: 19 February 2019 Publication History

Abstract

In this issue, the automata column discusses a powerful decision procedure for infinite state systems, which I would call the Hilbert Method, because it uses theorems like Hilbert's Basis Theorem or the Nullstellensatz. The method - which reduces combinatorial objects like words or trees to algebraic objects like numbers and polynomials - has been used to solve important open problems like: Ehrenfeucht's Conjecture, the equivalence problem for HDT0L systems, or the equivalence problem for tree-to-string transducers. Because of its power, generality and simplicity, I think that the method should become a standard part of the toolkit of automata theory for working with infinite state systems, joining established methods like integer programming or well-structured transition systems.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGLOG News
ACM SIGLOG News  Volume 6, Issue 1
January 2019
39 pages
EISSN:2372-3491
DOI:10.1145/3313909
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 February 2019
Published in SIGLOG Volume 6, Issue 1

Check for updates

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 38
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 20 Jan 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media