Synchronization of Parikh automata

DOI10.1007/978-3-031-33264-7_10MaRDI QIDQ6067332zbMATH OpenOpenAlexFDO

Authors Stefan Hoffmann

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

zbMATH Keywords

Parikh automatasynchronization

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Synchronizing deterministic push-down automata can be really hard
• Synchronizing deterministic push-down automata can be really hard
• Synchronization of automata with one undefined or ambiguous transition
• Synchronizing weighted automata
• Synchronizing words for weighted and timed automata

Cites work

• Affine Parikh automata
• Bounded Algol-Like Languages
• Černý's conjecture and the road colouring problem
• Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
• Constrained synchronization and commutativity
• Directable nondeterministic automata
• scientific article; zbMATH DE number 3823146 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3694623 (Why is no real title available?)
• scientific article; zbMATH DE number 176134 (Why is no real title available?)
• scientific article; zbMATH DE number 2038747 (Why is no real title available?)
• scientific article; zbMATH DE number 3222112 (Why is no real title available?)
• scientific article; zbMATH DE number 7730619 (Why is no real title available?)
• Infinite Synchronizing Words for Probabilistic Automata
• Minimal solutions of linear diophantine systems : bounds and algorithms
• On the computational complexity of problems related to distinguishability sets
• Path logics for querying graphs: combining expressiveness and efficiency
• Relationships between nondeterministic and deterministic tape complexities
• Semicomputable points in Euclidean spaces
• Semigroups, Presburger formulas, and languages
• Synchronizing automata over nested words
• Synchronizing data words for register automata
• Synchronizing Data Words for Register Automata
• Synchronizing deterministic push-down automata can be really hard
• Synchronizing Sequences for Probabilistic Automata
• Synchronizing words for weighted and timed automata
• The complexity of synchronizing Markov decision processes
• The taming of the semi-linear set
• Visibly pushdown languages

Cited in

(5)

• Synchronizing Automata Preserving a Chain of Partial Orders
• Synchronizing series-parallel deterministic finite automata with loops and related problems
• Synchronizing deterministic push-down automata can be really hard
• Synchronization of finite automata
• Synchronizing deterministic push-down automata can be really hard

This page was built for publication: Synchronization of Parikh automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6067332)