Between SC and LOGDCFL: Families of Languages Accepted by Polynomial-Time Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata.
Tomoyuki YamakamiPublished in: COCOON (2021)
Keyphrases
- turing machine
- finite automata
- linear space
- deterministic automata
- special case
- worst case
- low dimensional
- depth map
- expressive power
- language independent
- data model
- probabilistic automata
- finite state automata
- grammatical inference
- cross lingual
- data storage
- cellular automata
- regular expressions
- file system
- pattern matching
- space time
- search space