article

Alternating automata on infinite trees

Authors:

David, E. Muller,

Paul, E. SchuppAuthors Info & Claims

Theoretical Computer Science, Volume 54, Issue 2-3

Pages 267 - 276

https://doi.org/10.1016/0304-3975(87)90133-2

Published: 01 October 1987 Publication History

Abstract

No abstract available.

Cited By

View all

Mittelmann MMurano APerrussel LElkind E(2023)Discounting in strategy logicProceedings of the Thirty-Second International Joint Conference on Artificial Intelligence10.24963/ijcai.2023/26(225-233)Online publication date: 19-Aug-2023
https://dl.acm.org/doi/10.24963/ijcai.2023/26
Jochems JJones ERamsay S(2023)Higher-Order MSL Horn ConstraintsProceedings of the ACM on Programming Languages10.1145/35712627:POPL(2017-2047)Online publication date: 11-Jan-2023
https://dl.acm.org/doi/10.1145/3571262
Jantsch SMüller DBaier CKlein J(2021)From LTL to unambiguous Büchi automata via disambiguation of alternating automataFormal Methods in System Design10.1007/s10703-021-00379-z58:1-2(42-82)Online publication date: 15-Dec-2021
https://dl.acm.org/doi/10.1007/s10703-021-00379-z
Show More Cited By

Index Terms

Alternating automata on infinite trees
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Trees
2. Theory of computation
  1. Formal languages and automata theory
  2. Models of computation

Recommendations

Alternating finite automata and related problems
Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings
LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science

This article is inspired by two works from the early 90s. The first one is by Bogaert and Tison who considered a model of automata on finite ranked trees where one can check equality and disequality constraints between direct subtrees: they proved that ...
Pebble alternating tree-walking automata and their recognizing power

Pebble tree-walking automata with alternation were first investigated by Milo, Suciu and Vianu (2003), who showed that tree languages recognized by these devices are exactly the regular tree languages. We strengthen this by proving the same result for ...

Comments

Information & Contributors

Information

Published In

Publisher

Elsevier Science Publishers Ltd.

United Kingdom

Publication History

Published: 01 October 1987

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

81
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Mittelmann MMurano APerrussel LElkind E(2023)Discounting in strategy logicProceedings of the Thirty-Second International Joint Conference on Artificial Intelligence10.24963/ijcai.2023/26(225-233)Online publication date: 19-Aug-2023
https://dl.acm.org/doi/10.24963/ijcai.2023/26
Jochems JJones ERamsay S(2023)Higher-Order MSL Horn ConstraintsProceedings of the ACM on Programming Languages10.1145/35712627:POPL(2017-2047)Online publication date: 11-Jan-2023
https://dl.acm.org/doi/10.1145/3571262
Jantsch SMüller DBaier CKlein J(2021)From LTL to unambiguous Büchi automata via disambiguation of alternating automataFormal Methods in System Design10.1007/s10703-021-00379-z58:1-2(42-82)Online publication date: 15-Dec-2021
https://dl.acm.org/doi/10.1007/s10703-021-00379-z
Carreiro FFacchini AVenema YZanasi F(2020)The Power of the WeakACM Transactions on Computational Logic10.1145/337239221:2(1-47)Online publication date: 9-Jan-2020
https://dl.acm.org/doi/10.1145/3372392
Liu WYin LLi T(2020)Compiling FL on Finite WordsDependable Software Engineering. Theories, Tools, and Applications10.1007/978-3-030-62822-2_7(108-123)Online publication date: 24-Nov-2020
https://dl.acm.org/doi/10.1007/978-3-030-62822-2_7
Jantsch SMüller DBaier CKlein J(2019)From LTL to Unambiguous Büchi Automata via Disambiguation of Alternating AutomataFormal Methods – The Next 30 Years10.1007/978-3-030-30942-8_17(262-279)Online publication date: 7-Oct-2019
https://dl.acm.org/doi/10.1007/978-3-030-30942-8_17
Pradic PRiba C(2018)LMSOProceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3209108.3209195(849-858)Online publication date: 9-Jul-2018
https://dl.acm.org/doi/10.1145/3209108.3209195
Boker UShaulian Y(2018)Automaton-Based Criteria for Membership in CTLProceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3209108.3209143(155-164)Online publication date: 9-Jul-2018
https://dl.acm.org/doi/10.1145/3209108.3209143
Bozzelli LSánchez C(2018)Visibly Linear Temporal LogicJournal of Automated Reasoning10.1007/s10817-017-9410-z60:2(177-220)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1007/s10817-017-9410-z
Berthon RMaubert BMurano ARubin SVardi MAceto LIngólfsdóttir A(2017)Strategy logic with imperfect informationProceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3329995.3330071(1-12)Online publication date: 20-Jun-2017
https://dl.acm.org/doi/10.5555/3329995.3330071
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Alternating finite automata and related problems

Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings

Pebble alternating tree-walking automata and their recognizing power

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations