Cargando…
Space Complexity of Stack Automata Models
This paper examines several measures of space complexity on variants of stack automata: non-erasing stack automata and checking stack automata. These measures capture the minimum stack size required to accept any word in a language (weak measure), the maximum stack size used in any accepting computa...
Autores principales: | Ibarra, Oscar H., Jirásek, Jozef, McQuillan, Ian, Prigioniero, Luca |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7247887/ http://dx.doi.org/10.1007/978-3-030-48516-0_11 |
Ejemplares similares
-
Viral Gene Compression: Complexity and Verification
por: Daley, Mark, et al.
Publicado: (2005) -
A verification strategy for web services composition using enhanced stacked automata model
por: Nagamouttou, Danapaquiame, et al.
Publicado: (2015) -
Automata, computability and complexity : theory and applications /
por: Rich, Elaine
Publicado: (2008) -
Cellular automata and complex systems
por: Goles, Eric, et al.
Publicado: (1999) -
Lattice-Gas Cellular Automata: Simple Models of Complex Hydrodynamics
por: Rothman, Daniel H, et al.
Publicado: (1997)