Minimizing Finite Automata Is Computationally Hard

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-45007-6_31
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Designing Proxies for Stock Market Indices Is Computationally Hard *

Quantitative Finance
EconomicsEconometricsFinance
2001English

Deterministic Finite Automata

Algebra and Discrete Mathematics
2012English

Learning Stochastic Finite Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

On Evaluating Human Problem Solving of Computationally Hard Problems

Journal of Problem Solving
Applied Psychology
2013English

On Finite Monoids of Cellular Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Coevolution of Finite Automata With Errors

Journal of Evolutionary Economics
AccountingManagementEconomicsEconometricsBusiness
2013English

Finite-State Automata on Infinite Inputs

2012English

Stimulus-Response Theory of Finite Automata

Journal of Mathematical Psychology
Applied MathematicsPsychology
1969English

Diversity-Based Inference of Finite Automata

1987English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy