Skip to content
VuFind
  • Login
    • English
    • Deutsch
    • Español
    • Français
    • Italiano
Advanced
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Save to List
  • Permanent link
Cover Image

Saved in:
Bibliographic Details
Main Author: Yamakami, Tomoyuki
Format: Preprint
Published: 2024
Subjects:
Computational Complexity
Formal Languages and Automata Theory
Symbolic Computation
Online Access:https://arxiv.org/abs/2403.09145
Tags: Add Tag
No Tags, Be the first to tag this record!
  • Holdings
  • Description
  • Table of Contents
  • Comments
  • Similar Items
  • Staff View

Internet

https://arxiv.org/abs/2403.09145

Similar Items

  • Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata
    by: Yamakami, Tomoyuki
    Published: (2023)
  • Unambiguous and Co-Nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters
    by: Yamakami, Tomoyuki
    Published: (2024)
  • Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-in Cascading Circuits
    by: Yamakami, Tomoyuki
    Published: (2024)
  • Between SC and LOGDCFL: Families of Languages Accepted by Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata
    by: Yamakami, Tomoyuki
    Published: (2022)
  • Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas
    by: Yamakami, Tomoyuki
    Published: (2021)

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Browse Alphabetically
  • Explore Channels
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs