0000000000598348

AUTHOR

Aleksejs Naumovs

showing 1 related works from this author

The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints

2019

Discrete Mathematics & Theoretical Computer Science ; vol. 22 no. 1 ; Automata, Logic and Semantics ; 1365-8050

FOS: Computer and information sciencesQuantum PhysicsFormal Languages and Automata Theory (cs.FL)FOS: Physical sciencesComputer Science - Formal Languages and Automata TheoryComputational Complexity (cs.CC)Nonlinear Sciences::Cellular Automata and Lattice GasesComputer Science - Computational ComplexityMathematics::LogicTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputer Science::Discrete MathematicsComputer Science::Logic in Computer ScienceComputingMilieux_COMPUTERSANDSOCIETYMathematics::Metric GeometryQuantum Physics (quant-ph)Computer Science::Formal Languages and Automata Theory
researchProduct