6533b834fe1ef96bd129ce22
RESEARCH PRODUCT
Exact affine counter automata
Jevgēnijs VihrovsAbuzer YakaryilmazKrišjānis PrūsisKamil KhadievMasaki Nakanishisubject
FOS: Computer and information sciencesTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESautomataFormal Languages and Automata Theory (cs.FL)GeneralizationComputer scienceFOS: Physical sciencesComputer Science - Formal Languages and Automata Theorycounter automataМатематика0102 computer and information sciences02 engineering and technologyComputational Complexity (cs.CC)01 natural sciencesquantum computinglcsh:QA75.5-76.95Deterministic pushdown automatonComputer Science (miscellaneous)0202 electrical engineering electronic engineering information engineeringQuantum finite automataPromise problemTime complexityDiscrete mathematicsQuantum Physicscomputational complexityFinite-state machinelcsh:MathematicsИнформатикаpushdown automatalcsh:QA1-939Nonlinear Sciences::Cellular Automata and Lattice GasesКибернетикаAutomatonComputer Science - Computational ComplexityTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES010201 computation theory & mathematics020201 artificial intelligence & image processinglcsh:Electronic computers. Computer scienceAffine transformationaffine computingQuantum Physics (quant-ph)Computer Science::Formal Languages and Automata Theorydescription
We introduce an affine generalization of counter automata, and analyze their ability as well as affine finite automata. Our contributions are as follows. We show that there is a language that can be recognized by exact realtime affine counter automata but by neither 1-way deterministic pushdown automata nor realtime deterministic k-counter automata. We also show that a certain promise problem, which is conjectured not to be solved by two-way quantum finite automata in polynomial time, can be solved by Las Vegas affine finite automata. Lastly, we show that how a counter helps for affine finite automata by showing that the language MANYTWINS, which is conjectured not to be recognized by affine, quantum or classical finite state models in polynomial time, can be recognized by affine counter automata with one-sided bounded-error in realtime.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2017-03-13 |