:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autor principal:	Hu, Zino H.
Formato:	Preprint
Publicado:	2011
Materias:	Formal Languages and Automata Theory Group Theory F.1.1
Acceso en línea:	https://arxiv.org/abs/1104.3314
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Deterministic Suffix-reading Automata
por: Keerthan, R, et al.
Publicado: (2024)

On Constructing Finite Automata by Relational Programming
por: Egri-Nagy, Attila, et al.
Publicado: (2025)

Reachability for Multi-Priced Timed Automata with Positive and Negative Rates
por: Scoones, Andrew, et al.
Publicado: (2024)

Equivalence of Deterministic Weighted Real-time One-Counter Automata
por: Mathew, Prince, et al.
Publicado: (2024)

On Repetitive Finite Automata with Translucent Words
por: Mráz, František, et al.
Publicado: (2025)

On the Boolean Closure of Deterministic Top-Down Tree Automata
por: Löding, Christof, et al.
Publicado: (2024)

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
por: Bojańczyk, Mikołaj, et al.
Publicado: (2021)

On Minimization and Learning of Deterministic $ω$-Automata in the Presence of Don't Care Words
por: Löding, Christof, et al.
Publicado: (2022)

Deterministic Suffix-reading Automata
por: Keerthan, R, et al.
Publicado: (2025)

Learning Tree Automata with Term Rewriting
por: Kopystiański, Jakub, et al.
Publicado: (2026)

Exploring VASS Parameterised by Geometric Dimension
por: Czerwiński, Wojciech, et al.
Publicado: (2026)

Separability in Büchi Vass and Singly Non-Linear Systems of Inequalities
por: Baumann, Pascal, et al.
Publicado: (2024)

Flattability of Priority Vector Addition Systems
por: Guttenberg, Roland
Publicado: (2024)

Checking Timed Bisimilarity with Virtual Clocks
por: Lieb, Alexander, et al.
Publicado: (2024)

Construction of Minkowski Sums by Cellular Automata
por: Tahay, Pierre-Adrien
Publicado: (2024)

List of Results on the Černý Conjecture and Reset Thresholds for Synchronizing Automata
por: Volkov, Mikhail V.
Publicado: (2025)

Geometric Characterization of Context-Free Intersections via the Inner Segment Dichotomy
por: Silva, Jorge Miguel
Publicado: (2026)

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
por: Guillon, Bruno, et al.
Publicado: (2025)

On Transition Constructions for Automata -- A Categorical Perspective
por: Cruchten, Mike
Publicado: (2024)

How Concise are Chains of co-Büchi Automata?
por: Ehlers, Rüdiger
Publicado: (2025)

Input-Erasing Two-Way Finite Automata
por: Meduna, Alexander, et al.
Publicado: (2025)

Finitely Presentable Higher-Dimensional Automata and the Irrationality of Process Replication
por: Basold, Henning, et al.
Publicado: (2023)

Turn Complexity of Context-free Languages, Pushdown Automata and One-Counter Automata
por: Pighizzini, Giovanni
Publicado: (2026)

A Uniform Framework for Problems on Context-Free Grammars
por: Esparza, Javier, et al.
Publicado: (2024)

Recognizing Numbers
por: Gaba, Pranshu, et al.
Publicado: (2025)

Lexicographic transductions of finite words
por: Filiot, Emmanuel, et al.
Publicado: (2025)

Probabilistic Finite Automaton Emptiness is undecidable
por: Rote, Günter
Publicado: (2024)

Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton
por: Rote, Günter
Publicado: (2024)

On some Classes of Reversible 2-head Automata
por: Nagy, Benedek, et al.
Publicado: (2025)

Functional Closure Properties of Finite $\mathbb{N}$-weighted Automata
por: Dörfler, Julian, et al.
Publicado: (2024)

Edit Distance of Finite-Valued Transducers
por: Mathew, Prince, et al.
Publicado: (2026)

Edit Distance of Finite State Transducers
por: Aiswarya, C., et al.
Publicado: (2024)

PVASS Reachability is Decidable
por: Guttenberg, Roland, et al.
Publicado: (2025)

Exploring Complexity: An Extended Study of Formal Properties for Process Model Complexity Measures
por: Schalk, Patrizia, et al.
Publicado: (2024)

Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests
por: Guttenberg, Roland, et al.
Publicado: (2025)

A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
por: Grabolle, Gustav
Publicado: (2022)

Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework
por: Lee, Changryeol
Publicado: (2026)

Identity Testing for Stochastic Languages
por: Agarwal, Smayan, et al.
Publicado: (2025)

Hypernode Automata
por: Bartocci, Ezio, et al.
Publicado: (2023)

Dual Adjunction Between $Ω$-Automata and Wilke Algebra Quotients
por: Chernev, Anton, et al.
Publicado: (2024)