Imagen de Portada

Unambiguous and Co-Nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Yamakami, Tomoyuki
Formato:	Preprint
Publicado:	2024
Materias:	Computational Complexity Formal Languages and Automata Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The No Endmarker Theorem for One-Way Probabilistic Pushdown Automata
por: Yamakami, Tomoyuki
Publicado: (2021)

Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-in Cascading Circuits
por: Yamakami, Tomoyuki
Publicado: (2024)

Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata
por: Yamakami, Tomoyuki
Publicado: (2023)

Nonuniform Families of Polynomial-Size Quantum Finite Automata and Quantum Logarithmic-Space Computation with Polynomial-Size Advice
por: Yamakami, Tomoyuki
Publicado: (2019)

Between SC and LOGDCFL: Families of Languages Accepted by Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata
por: Yamakami, Tomoyuki
Publicado: (2022)

How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory?
por: Yamakami, Tomoyuki
Publicado: (2020)

Complexity of Unary Exclusive Nondeterministic Finite Automata
por: Kutrib, Martin, et al.
Publicado: (2024)

Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas
por: Yamakami, Tomoyuki
Publicado: (2021)

Complexity Classification of Complex-Weighted Counting Acyclic Constraint Satisfaction Problems
por: Yamakami, Tomoyuki
Publicado: (2024)

Explorability in Pushdown Automata
por: Bedi, Ayaan, et al.
Publicado: (2025)

Visibly Recursive Automata
por: Dubrulle, Kévin, et al.
Publicado: (2026)

Maximal Length Cellular Automata : A Survey
por: Adak, Sumit, et al.
Publicado: (2024)

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter
por: Shakiba, Yousef, et al.
Publicado: (2025)

Proceedings of the 15th International Workshop on Non-Classical Models of Automata and Applications
por: Moreira, Nelma, et al.
Publicado: (2025)

Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024)
por: Manea, Florin, et al.
Publicado: (2024)

Input-Driven Pushdown Automata with Translucent Input Letters
por: Kutrib, Martin, et al.
Publicado: (2025)

On Complementation of Nondeterministic Finite Automata without Full Determinization (Technical Report)
por: Holík, Lukáš, et al.
Publicado: (2025)

Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques
por: Kiefer, Stefan, et al.
Publicado: (2019)

Global One-Counter Tree Automata
por: Herrmann, Luisa, et al.
Publicado: (2024)

Bandwidth of Nondeterministic Finite Automata
por: Cho, Da-Jung, et al.
Publicado: (2026)

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
por: Guha, Shibashis, et al.
Publicado: (2021)

Proceedings Fifteenth International Symposium on Games, Automata, Logics, and Formal Verification
por: Achilleos, Antonis, et al.
Publicado: (2024)

The $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages
por: Göller, Stefan, et al.
Publicado: (2023)

Visual Execution and Validation of Finite-State Machines and Pushdown Automata
por: Morazán, Marco T., et al.
Publicado: (2025)

Saturation Problems for Families of Automata
por: Bohn, León, et al.
Publicado: (2025)

Finite Automata for Efficient Graph Recognition
por: Drewes, Frank, et al.
Publicado: (2024)

Repetitive Finite Automata With Translucent Letters
por: Mráz, František, et al.
Publicado: (2024)

Invariants for One-Counter Automata with Disequality Tests
por: Chistikov, Dmitry, et al.
Publicado: (2024)

Finite Automata Encoding Piecewise Polynomials
por: Berdinsky, Dmitry, et al.
Publicado: (2021)

Studying homing and synchronizing sequences for Timed Finite State Machines with output delays
por: Vinarskii, Evgenii, et al.
Publicado: (2025)

Mathematical Approach in Automata and Automata Association
por: Maciel, Sergio Henrique
Publicado: (2020)

Descriptional Complexity of Finite Automata -- Selected Highlights
por: Salomaa, Arto, et al.
Publicado: (2023)

Measure Many Quantum Finite Automata on Infinite Words
por: Midya, Abhisek, et al.
Publicado: (2026)

Optimal Approximate Minimization of One-Letter Weighted Finite Automata
por: Lacroce, Clara, et al.
Publicado: (2023)

Parikh Automata on Finite and Infinite Words
por: Grobler, Mario, et al.
Publicado: (2023)

The Complexity of Nested Reset Counter Systems
por: Balasubramanian, A. R., et al.
Publicado: (2026)

Reversible Weighted Automata over Finite Rings and Monoids with Commuting Idempotents
por: Kostolányi, Peter, et al.
Publicado: (2026)

Mata, a Fast and Simple Finite Automata Library (Technical Report)
por: Chocholatý, David, et al.
Publicado: (2023)

On Shuffling and Splitting Automata
por: Cunningham, Ignacio Mollo
Publicado: (2024)

Explorable Parity Automata
por: Hazard, Emile, et al.
Publicado: (2024)