Cargando…
Limited Two-Way Deterministic Finite Automata with Advice
External assistance in the form of strings called advice is given to an automaton in order to make it a non-uniform model of computation. Automata with advice are then examined to better understand the limitations imposed by uniformity, which is a typical property shared by all feasible computationa...
Autor principal: | Uçan, Ahmet Bilal |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7206619/ http://dx.doi.org/10.1007/978-3-030-40608-0_15 |
Ejemplares similares
-
Probabilistic Deterministic Finite Automata and Recurrent Networks, Revisited
por: Marzen, Sarah E., et al.
Publicado: (2022) -
Efficient Deterministic Finite Automata Minimization Based on Backward Depth Information
por: Liu, Desheng, et al.
Publicado: (2016) -
Alternating Finite Automata with Limited Universal Branching
por: Keeler, Chris, et al.
Publicado: (2020) -
Finite automata
por: Lawson, Mark V
Publicado: (2003) -
Simulations of Quantum Finite Automata
por: Lippa, Gustaw, et al.
Publicado: (2020)