skip to main content
research-article

Automata column

Published: 14 October 2014 Publication History

Abstract

The list in this paper is, of course, a personal selection of open problems that are connected to both automata and logic. The problems are listed in no particular order.

References

[1]
A. Arnold. 1999. The μ-calculus alternation-depth hierarchy is strict on binary trees. Informatique Théorique et Applications 33, 4/5 (1999), 329--340.
[2]
Michael Benedikt and Luc Segoufin. 2009. Regular tree languages definable in FO and in FOmod. ACM Trans. Comput. Log. 11, 1 (2009).
[3]
Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer, and Jan Obdrzálek. 2012a. The dag-width of directed graphs. J. Comb. Theory, Ser. B 102, 4 (2012), 900--923.
[4]
Dietmar Berwanger, Erich Grädel, Łukasz Kaiser, and Roman Rabinovich. 2012b. Entanglement and the Complexity of Directed Graphs. Theoretical Computer Science 463, 0 (2012), 2--25. http://logic.rwth-aachen.de/~rabinovich/entangle.pdf
[5]
Mikołaj Bojańczyk. 2007. Forest Expressions. In Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings. 146--160.
[6]
Mikołaj Bojańczyk, Anca Muscholl, Thomas Schwentick, and Luc Segoufin. 2009. Two-variable logic on data trees and XML reasoning. J. ACM 56, 3 (2009).
[7]
Mikolaj Bojanczyk, Luc Segoufin, and Howard Straubing. 2012. Piecewise testable tree languages. Logical Methods in Computer Science 8, 3 (2012).
[8]
J. C. Bradfield. 1998. The Modal μ-Calculus Alternation Hierarchy is Strict. Theor. Comput. Sci. 195, 2 (1998), 133--153.
[9]
J. A. Brzozowski. 1980. Open Problems about Regular Languages. Department of Computer Science, University of Waterloo.
[10]
E. Cardoza, Richard J. Lipton, and Albert R. Meyer. 1976. Exponential Space Complete Problems for Petri Nets and Commutative Semigroups: Preliminary Report. In Proceedings of the 8th Annual ACM Symposium on Theory of Computing, May 3-5, 1976, Hershey, Pennsylvania, USA. 50--54.
[11]
Thomas Colcombet, Denis Kuperberg, Christof Löding, and Michael Vanden Boom. 2013. Deciding the weak definability of Büchi definable tree languages. (2013). submitted.
[12]
Thomas Colcombet and Christof Löding. 2008. The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata. In ICALP (2). 398--409.
[13]
Philippe de Groote, Bruno Guillaume, and Sylvain Salvati. 2004. Vector Addition Tree Automata. In 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 14-17 July 2004, Turku, Finland, Proceedings. 64--73.
[14]
Jacques Duparc, Alessandro Facchini, and Filip Murlak. 2009. Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata. In CSL. 225--239.
[15]
Lawrence C. Eggan. 1963. Transition graphs and the star-height of regular events. Michigan Math. J. 10, 4 (1963), 385--397.
[16]
E. Allen Emerson and Charanjit S. Jutla. 1991. Tree Automata, Mu-Calculus and Determinacy (Extended Abstract). In 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991. 368--377.
[17]
Oliver Friedmann. 2009. An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it. In Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, 11-14 August 2009, Los Angeles, CA, USA. 145--156.
[18]
Oliver Friedmann, Thomas Dueholm Hansen, and Uri Zwick. 2011. Subexponential lower bounds for randomized pivoting rules for the simplex algorithm. In Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011. 283--292.
[19]
Yuri Gurevich and Saharon Shelah. 1982. Monadic theory of order and topology in ZFC. Annals of Mathematical Logic 23, 2-3 (1982), 179--198.
[20]
Thilo Hafer and Wolfgang Thomas. 1987. Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree. In Automata, Languages and Programming, 14th International Colloquium, ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings. 269--279.
[21]
Kosaburo Hashiguchi. 1988. Relative star height, star height and finite automata with distance functions. In Formal Properties of Finite Automata and Applications. 74--88.
[22]
Uschi Heuter. 1991. First-order properties of trees, star-free expressions, and aperiodicity. ITA 25 (1991), 125--146.
[23]
Paul Hunter and Stephan Kreutzer. 2008. Digraph measures: Kelly decompositions, games, and orderings. Theor. Comput. Sci. 399, 3 (2008), 206--219.
[24]
Daniel Kirsten. 2005. Distance desert automata and the star height problem. Informatique Théorique et Applications 39, 3 (2005), 455--509.
[25]
Ranko Lazić and Sylvain Schmitz. 2014. Non-elementary complexities for branching VASS, MELL, and extensions. In Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014. 61.
[26]
Jérôme Leroux. 2012. Vector Addition Systems Reachability Problem (A Simpler Solution). In Turing-100 - The Alan Turing Centenary, Manchester, UK, June 22-25, 2012. 214--228.
[27]
Ernst W. Mayr. 1984. An Algorithm for the General Petri Net Reachability Problem. SIAM J. Comp. 13, 3 (1984), 441--459.
[28]
R. McNaughton and S. Papert. 1971. Counter-Free Automata. MIT Press.
[29]
Andrzej W. Mostowski. 1991. Games with forbidden positions. Technical Report. University of Gdańsk.
[30]
D. E. Muller and P. E. Schupp. 1995. Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra. Theoretical Computer Science 141 (1995), 69--107.
[31]
Damian Niwiński and Igor Walukiewicz. 2003. A gap property of deterministic tree languages. Theor. Comput. Sci. 1, 303 (2003), 215--231.
[32]
Jan Obdrzálek. 2003. Fast Mu-Calculus Model Checking when Tree-Width Is Bounded. In CAV. 80--92.
[33]
Jan Obdrzálek. 2007. Clique-Width and Parity Games. In Computer Science Logic (CSL). 54--68.
[34]
Jean-Éric Pin, Howard Straubing, and Denis Thérien. 1992. Some Results on the Generalized Star-Height Problem. Inf. Comput. 101, 2 (1992), 219--250.
[35]
Thomas Place and Luc Segoufin. 2010. Deciding Definability in FO2(<) (or XPath) on Trees. In Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, 11-14 July 2010, Edinburgh, United Kingdom. 253--262.
[36]
A. Potthoff. 1995. First-Order Logic on Finite Trees. In Theory and Practice of Software Development (Lecture Notes in Computer Science), Vol. 915. 125--139.
[37]
M. O. Rabin. 1969. Decidability of Second-Order Theories and Automata on Infinite Trees. Transactions of the AMS 141 (1969), 1--23.
[38]
M. O. Rabin. 1970. Weakly Definable Relations and Special Automata. Mathematical Logic and Foundations of Set Theory (1970), 1--23.
[39]
Bernd-Holger Schlingloff. 1992. Expressive completeness of temporal logic of trees. Journal of Applied Non-Classical Logics 2, 2 (1992), 157--180.
[40]
M. P. Schützenberger. 1965. On Finite Monoids Having Only Trivial Subgroups. Information and Control 8 (1965), 190--194.
[41]
Saharon Shelah. 1975. The Monadic Theory of Order. The Annals of Mathematics 102, 3 (1975), 379--419.
[42]
Jerzy Skurczyński. 1993. The Borel hierarchy is infinite in the class of regular sets of trees. Theoretical Computer Science 112, 2 (1993), 413--418.
[43]
L. J. Stockmeyer. 1974. The Complexity of Decision Problems in Automata Theory and Logic. Ph.D. Dissertation.
[44]
J. W. Thatcher and J. B. Wright. 1968. Generalized Finite Automata Theory With an Application to a Decision Problem of Second-Order Logic. Mathematical Systems Theory 2, 1 (1968), 57--81.
[45]
Wolfgang Thomas. 1984. Logical Aspects in the Study of Tree Languages. In CAAP. 31--50.
[46]
Kumar Neeraj Verma and Jean Goubault-Larrecq. 2005. Karp-Miller Trees for a Branching Extension of VASS. Discrete Mathematics & Theoretical Computer Science 7, 1 (2005), 217--230.
[47]
Jens Vöge and Marcin Jurdziński. 2000. A Discrete Strategy Improvement Algorithm for Solving Parity Games. In Computer Aided Verification, 12th International Conference, CAV 2000, Chicago, IL, USA, July 15-19, 2000, Proceedings. 202--215.
[48]
Wiesław Zielonka. 1998. Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees. Theor. Comput. Sci. 200, 1-2 (1998), 135--183.

Cited By

View all

Index Terms

  1. Automata column

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM SIGLOG News
    ACM SIGLOG News  Volume 1, Issue 2
    October 2014
    32 pages
    EISSN:2372-3491
    DOI:10.1145/2677161
    Issue’s Table of Contents

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 14 October 2014
    Published in SIGLOG Volume 1, Issue 2

    Check for updates

    Qualifiers

    • Research-article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

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

    Other Metrics

    Citations

    Cited By

    View all

    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