Computing the Shortest Reset Words of Synchronizing Automata

Journal of Combinatorial Optimization - Netherlands
doi 10.1007/s10878-013-9682-0
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Lower Bounds for the Length of Reset Words in Eulerian Automata

International Journal of Foundations of Computer Science
Computer Science
2013English

Reset Sequences for Monotonic Automata

SIAM Journal on Computing
MathematicsComputer Science
1990English

Semisimple Synchronizing Automata and the Wedderburn-Artin Theory

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

A Linear Algebra Approach to Synchronizing Automata

English

Synchronizing Automata Preserving a Chain of Partial Orders

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2009English

Parallel Brute-Force Algorithm for Deriving Reset Sequences From Deterministic Incomplete Finite Automata

Turkish Journal of Electrical Engineering and Computer Sciences
Electronic EngineeringElectricalComputer Science
2019English

Decidable Problems for Probabilistic Automata on Infinite Words

2012English

Probabilistic Automata on Finite Words: Decidable and Undecidable Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Computing Many-To-Many Shortest Paths Using Highway Hierarchies

2007English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy