The Average State Complexity of the Star of a Finite Set of Words Is Linear

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-85780-8_10
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

The Average State Complexity of Rational Operations on Finite Languages

International Journal of Foundations of Computer Science
Computer Science
2010English

On Near Optimality of the Set of Finite-State Controllers for Average Cost POMDP

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2008English

Is a “Star” Worth a Thousand Words?

European Journal of Marketing
Marketing
2009English

On the Linear Extension Complexity of Stable Set Polytopes for Perfect Graphs

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2019English

Secure Computation of Private Set Intersection Cardinality With Linear Complexity

Advances in Information Security, Privacy, and Ethics
2019English

On the Character of Words of Sublinear Complexity

Acta Arithmetica
Number TheoryAlgebra
2018English

The Emerging Theory of Average-Case Complexity

1990English

The Minimum Size of a Linear Set

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2019English

Black Hole-Neutron Star Mergers Using a Survey of Finite-Temperature Equations of State

Physical Review D
AstronomyPhysics
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy