Open Problems in Automata Theory

Contributions from the Autobóz Community

Menu Close

Home
Archives
Categories
Tags
About
autóboz website

2019

Jul 01, 2019

19.12 Reachability for bounded branching VASS

Jul 01, 2019

19.11 Shortest runs in 3-D VASS

Jul 01, 2019

19.10 Variants of one-counter systems universality

Prev 12

Search for:

Connect With Us

Recent Posts

25.29 Left quotient operator on regular expressions
July 1, 2025
25.28 A Streaming Machine Model for Polyregular Functions
July 1, 2025
25.27 Increasing-unbounded Simple Components
July 1, 2025
25.26 Memory requirements of subgame perfect equilibria in reachability games
July 1, 2025
25.25 Do probabilities matter for resolving nondeterminism?
July 1, 2025
25.24 Classes of languages with objective-independent memory
July 1, 2025

Tags

Tag Cloud

CFL ETH Games on graphs Kleene algebra MDP Markov chains Nash equilibria Petri nets Petri nets with data Skolem problem VASS XML Z-VASS algebra algorithms automata automata over infinite words bi-reachablility boundedness channels circuits communicating automata complexity constraint context-free grammars continuity control theory cost register automata counter counter machines coverability descriptional complexity distributed networks emptiness checking equilibria fine-grained complexity first-order logic fixpoint formal languages formal series game games games on graphs graph groups graphs groups infinite alphabets infinite tree infinite words infinite-state systems invariants languages left quotients linear dynamical systems logic markov decision processes networks neural networks normal closure parameterized games parameterized verification parity automata parity games peacewise-testable languages petri nets polynomial-time population protocols positionality probabilistic programs probabilities proof rules pushdown pushdown automata pvass raags reachability relation semilinear sets separation session types simulation stochastic processes string constraints subtyping synthesis temporal graphs temporal logic termination timed automata transducers tree automata trees two variables valence systems vas vass vector addition systems verification weighted automata well-quasi-order word combinatorics

Archives

July 202529
July 202419
July 20238
July 202218
July 202012
July 201916

© 2026 Open Problems in Automata Theory All Rights Reserved.

Theme by hipaper