Synchronization of Parikh automata
From MaRDI portal
Publication:6067332
DOI10.1007/978-3-031-33264-7_10OpenAlexW4377081532MaRDI QIDQ6067332
Publication date: 16 November 2023
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-33264-7_10
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
- On the computational complexity of problems related to distinguishability sets
- The complexity of synchronizing Markov decision processes
- Černý's conjecture and the road colouring problem
- Constrained synchronization and commutativity
- Semigroups, Presburger formulas, and languages
- Relationships between nondeterministic and deterministic tape complexities
- P(l)aying for Synchronization
- Infinite Synchronizing Words for Probabilistic Automata
- Visibly pushdown languages
- The taming of the semi-linear set
- Synchronizing Data Words for Register Automata
- Path Logics for Querying Graphs: Combining Expressiveness and Efficiency
- Affine Parikh automata
- Minimal solutions of linear diophantine systems : bounds and algorithms
- Semicomputable points in Euclidean spaces
- Synchronizing Automata over Nested Words
- Synchronizing Data Words for Register Automata
- Bounded Algol-Like Languages
- Synchronizing Sequences for Probabilistic Automata
This page was built for publication: Synchronization of Parikh automata
