Lower Bounds for the Length of Reset Words in Eulerian Automata

International Journal of Foundations of Computer Science - Singapore
doi 10.1142/s0129054113400108
Full Text
Abstract

Available in full text

Date
Authors
Publisher

World Scientific Pub Co Pte Lt

Related search

Computing the Shortest Reset Words of Synchronizing Automata

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2013English

Lower Bounds for Complementation of Omega-Automata via the Full Automata Technique

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Reset Sequences for Monotonic Automata

SIAM Journal on Computing
MathematicsComputer Science
1990English

Optimal Lower Bounds for Quantum Automata and Random Access Codes

English

Lower Bounds on the Length of Monotone Paths in Arrangements

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1991English

Input Distance and Lower Bounds for Propositional Resolution Proof Length

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Bounds on the Number of Eulerian Orientations

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
1983English

Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Computer NetworksOpticsMolecular Physics,CommunicationsOpticalAtomicMagnetic MaterialsElectronic
2007English

Tighter Bounds for the Determinisation of Büchi Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy