State complexity of Boolean operations on graph-walking automata
From MaRDI portal
Cites work
- A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton
- Automata and Labyrinths
- Complement for two-way alternating automata
- Complementing deterministic tree-walking automata
- Complementing two-way finite automata
- Graph exploration by a finite automaton
- Graph-walking automata: from whence they come, and whither they are bound
- Halting space-bounded computations
- scientific article; zbMATH DE number 3353192 (Why is no real title available?)
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- On complementing unambiguous automata and graphs with many cliques and cocliques
- Operational state complexity of nested word automata
- Partial orders on words, minimal elements of regular languages, and state complexity
- Reversibility of computations in graph-walking automata
- State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata
- Tight bounds for undirected graph exploration with pebbles and multiple agents
- Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata
- Tree-Walking Automata Do Not Recognize All Regular Languages
This page was built for publication: State complexity of Boolean operations on graph-walking automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7316805)
