The Average State Complexity of Rational Operations on Finite Languages

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

Available in full text

Date
Authors
Publisher

World Scientific Pub Co Pte Lt

Related search

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Ω-Rational Languages: High Complexity Classes vs. Borel Hierarchy

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

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

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2008English

Locally Finite Ω-Languages and Effective Analytic Sets Have the Same Topological Complexity

Mathematical Logic Quarterly
Logic
2016English

Finite-State Registered Automata and Their Uses in Natural Languages

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

On the Inclusion Problem for Finitely Ambiguous Rational Trace Languages

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
1998English

The Emerging Theory of Average-Case Complexity

1990English

On the Complexity of Parallel Parsing of General Context-Free Languages

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1986English

Measuring Complexity Through Average Symmetry

Journal of Physics A: Mathematical and Theoretical
StatisticsProbabilityNonlinear PhysicsSimulationMathematical PhysicsStatisticalModelingAstronomyPhysics
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy