Open Problems in Automata Theory

Contributions from the Autobóz Community
Menu Close
  • Home
  • Archives
  • Categories
  • Tags
  • About
  • autóboz website

2024

Jul 05, 2024

24.12 Fine-grained complexity of reachability in one-counter automata

2020

Nov 03, 2020

20.10 Tighten the complexity of solving random-turn games

Nov 03, 2020

20.11 The sequential flow problem

Jul 21, 2020

20.1 Universality of letter-bounded CFLs

2019

Jul 19, 2019

19.12 Reachability for bounded branching VASS

Jul 19, 2019

19.5 On unambiguous grammars

Jul 19, 2019

19.3 Universality for unambiguous automata

Connect With Us

  • Recent Posts
  • 24.19 Reachability in Reversible Data VASS
    July 14, 2024
  • 24.17 Monotone regular functions
    July 13, 2024
  • 24.18 Lower bounds for determinizability of weighted automata over \(\mathbb Q\)
    July 13, 2024
  • 24.16 Speed of victory in adversarial population games
    July 12, 2024
  • 24.15 Games under delays and loss
    July 11, 2024
  • 24.6 Emptiness-checking for 3-clock Timed Automata with additive constraints
    July 5, 2024

Tags

  • CFL1
  • Games on graphs1
  • Kleene algebra1
  • Markov chains1
  • Nash equilibria1
  • Petri nets1
  • Petri nets with data1
  • Skolem problem2
  • VASS8
  • XML1
  • algebra6
  • automata19
  • bi-reachablility1
  • channels1
  • circuits1
  • communicating automata1
  • complexity7
  • context-free grammars2
  • continuity2
  • cost register automata2
  • counter machines7
  • coverability2
  • descriptional complexity2
  • distributed networks1
  • emptiness checking1
  • first-order logic1
  • fixpoint1
  • game1
  • games5
  • graphs1
  • infinite words3
  • invariants1
  • languages1
  • linear dynamical systems1
  • logic6
  • markov decision processes1
  • networks1
  • neural networks1
  • parameterized games1
  • parameterized verification2
  • parity games1
  • peacewise-testable languages1
  • petri nets1
  • population protocols2
  • positionality1
  • pushdown3
  • pushdown automata6
  • pvass1
  • reachability7
  • separation2
  • session types1
  • stochastic processes1
  • string constraints1
  • subtyping1
  • temporal logic2
  • timed automata4
  • transducers2
  • trees1
  • two variables1
  • valence systems1
  • vass5
  • verification2
  • weighted automata4

Tag Cloud

CFL Games on graphs Kleene algebra Markov chains Nash equilibria Petri nets Petri nets with data Skolem problem VASS XML algebra automata bi-reachablility channels circuits communicating automata complexity context-free grammars continuity cost register automata counter machines coverability descriptional complexity distributed networks emptiness checking first-order logic fixpoint game games graphs infinite words invariants languages linear dynamical systems logic markov decision processes networks neural networks parameterized games parameterized verification parity games peacewise-testable languages petri nets population protocols positionality pushdown pushdown automata pvass reachability separation session types stochastic processes string constraints subtyping temporal logic timed automata transducers trees two variables valence systems vass verification weighted automata

Archives

  • July 202417
  • June 20242
  • April 20243
  • September 20231
  • August 20231
  • July 20231
  • September 202218
  • November 20204
  • August 20201
  • July 20207
  • July 201916
© 2024 Open Problems in Automata Theory All Rights Reserved.
Theme by hipaper