Saved in:
| Main Author: | Hu, Zino H. |
|---|---|
| Format: | Preprint |
| Published: |
2011
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/1104.3314 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Deterministic Suffix-reading Automata
by: Keerthan, R, et al.
Published: (2024)
by: Keerthan, R, et al.
Published: (2024)
On Constructing Finite Automata by Relational Programming
by: Egri-Nagy, Attila, et al.
Published: (2025)
by: Egri-Nagy, Attila, et al.
Published: (2025)
Reachability for Multi-Priced Timed Automata with Positive and Negative Rates
by: Scoones, Andrew, et al.
Published: (2024)
by: Scoones, Andrew, et al.
Published: (2024)
Equivalence of Deterministic Weighted Real-time One-Counter Automata
by: Mathew, Prince, et al.
Published: (2024)
by: Mathew, Prince, et al.
Published: (2024)
On Repetitive Finite Automata with Translucent Words
by: Mráz, František, et al.
Published: (2025)
by: Mráz, František, et al.
Published: (2025)
On the Boolean Closure of Deterministic Top-Down Tree Automata
by: Löding, Christof, et al.
Published: (2024)
by: Löding, Christof, et al.
Published: (2024)
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
by: Bojańczyk, Mikołaj, et al.
Published: (2021)
by: Bojańczyk, Mikołaj, et al.
Published: (2021)
On Minimization and Learning of Deterministic $ω$-Automata in the Presence of Don't Care Words
by: Löding, Christof, et al.
Published: (2022)
by: Löding, Christof, et al.
Published: (2022)
Deterministic Suffix-reading Automata
by: Keerthan, R, et al.
Published: (2025)
by: Keerthan, R, et al.
Published: (2025)
Learning Tree Automata with Term Rewriting
by: Kopystiański, Jakub, et al.
Published: (2026)
by: Kopystiański, Jakub, et al.
Published: (2026)
Exploring VASS Parameterised by Geometric Dimension
by: Czerwiński, Wojciech, et al.
Published: (2026)
by: Czerwiński, Wojciech, et al.
Published: (2026)
Separability in Büchi Vass and Singly Non-Linear Systems of Inequalities
by: Baumann, Pascal, et al.
Published: (2024)
by: Baumann, Pascal, et al.
Published: (2024)
Flattability of Priority Vector Addition Systems
by: Guttenberg, Roland
Published: (2024)
by: Guttenberg, Roland
Published: (2024)
Checking Timed Bisimilarity with Virtual Clocks
by: Lieb, Alexander, et al.
Published: (2024)
by: Lieb, Alexander, et al.
Published: (2024)
Construction of Minkowski Sums by Cellular Automata
by: Tahay, Pierre-Adrien
Published: (2024)
by: Tahay, Pierre-Adrien
Published: (2024)
List of Results on the Černý Conjecture and Reset Thresholds for Synchronizing Automata
by: Volkov, Mikhail V.
Published: (2025)
by: Volkov, Mikhail V.
Published: (2025)
Geometric Characterization of Context-Free Intersections via the Inner Segment Dichotomy
by: Silva, Jorge Miguel
Published: (2026)
by: Silva, Jorge Miguel
Published: (2026)
Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
by: Guillon, Bruno, et al.
Published: (2025)
by: Guillon, Bruno, et al.
Published: (2025)
On Transition Constructions for Automata -- A Categorical Perspective
by: Cruchten, Mike
Published: (2024)
by: Cruchten, Mike
Published: (2024)
How Concise are Chains of co-Büchi Automata?
by: Ehlers, Rüdiger
Published: (2025)
by: Ehlers, Rüdiger
Published: (2025)
Input-Erasing Two-Way Finite Automata
by: Meduna, Alexander, et al.
Published: (2025)
by: Meduna, Alexander, et al.
Published: (2025)
Finitely Presentable Higher-Dimensional Automata and the Irrationality of Process Replication
by: Basold, Henning, et al.
Published: (2023)
by: Basold, Henning, et al.
Published: (2023)
Turn Complexity of Context-free Languages, Pushdown Automata and One-Counter Automata
by: Pighizzini, Giovanni
Published: (2026)
by: Pighizzini, Giovanni
Published: (2026)
A Uniform Framework for Problems on Context-Free Grammars
by: Esparza, Javier, et al.
Published: (2024)
by: Esparza, Javier, et al.
Published: (2024)
Recognizing Numbers
by: Gaba, Pranshu, et al.
Published: (2025)
by: Gaba, Pranshu, et al.
Published: (2025)
Lexicographic transductions of finite words
by: Filiot, Emmanuel, et al.
Published: (2025)
by: Filiot, Emmanuel, et al.
Published: (2025)
Probabilistic Finite Automaton Emptiness is undecidable
by: Rote, Günter
Published: (2024)
by: Rote, Günter
Published: (2024)
Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton
by: Rote, Günter
Published: (2024)
by: Rote, Günter
Published: (2024)
On some Classes of Reversible 2-head Automata
by: Nagy, Benedek, et al.
Published: (2025)
by: Nagy, Benedek, et al.
Published: (2025)
Functional Closure Properties of Finite $\mathbb{N}$-weighted Automata
by: Dörfler, Julian, et al.
Published: (2024)
by: Dörfler, Julian, et al.
Published: (2024)
Edit Distance of Finite-Valued Transducers
by: Mathew, Prince, et al.
Published: (2026)
by: Mathew, Prince, et al.
Published: (2026)
Edit Distance of Finite State Transducers
by: Aiswarya, C., et al.
Published: (2024)
by: Aiswarya, C., et al.
Published: (2024)
PVASS Reachability is Decidable
by: Guttenberg, Roland, et al.
Published: (2025)
by: Guttenberg, Roland, et al.
Published: (2025)
Exploring Complexity: An Extended Study of Formal Properties for Process Model Complexity Measures
by: Schalk, Patrizia, et al.
Published: (2024)
by: Schalk, Patrizia, et al.
Published: (2024)
Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests
by: Guttenberg, Roland, et al.
Published: (2025)
by: Guttenberg, Roland, et al.
Published: (2025)
A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
by: Grabolle, Gustav
Published: (2022)
by: Grabolle, Gustav
Published: (2022)
Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework
by: Lee, Changryeol
Published: (2026)
by: Lee, Changryeol
Published: (2026)
Identity Testing for Stochastic Languages
by: Agarwal, Smayan, et al.
Published: (2025)
by: Agarwal, Smayan, et al.
Published: (2025)
Hypernode Automata
by: Bartocci, Ezio, et al.
Published: (2023)
by: Bartocci, Ezio, et al.
Published: (2023)
Dual Adjunction Between $Ω$-Automata and Wilke Algebra Quotients
by: Chernev, Anton, et al.
Published: (2024)
by: Chernev, Anton, et al.
Published: (2024)
Similar Items
-
Deterministic Suffix-reading Automata
by: Keerthan, R, et al.
Published: (2024) -
On Constructing Finite Automata by Relational Programming
by: Egri-Nagy, Attila, et al.
Published: (2025) -
Reachability for Multi-Priced Timed Automata with Positive and Negative Rates
by: Scoones, Andrew, et al.
Published: (2024) -
Equivalence of Deterministic Weighted Real-time One-Counter Automata
by: Mathew, Prince, et al.
Published: (2024) -
On Repetitive Finite Automata with Translucent Words
by: Mráz, František, et al.
Published: (2025)