Input-Driven Pushdown Automata with Translucent Input Letters
Fuente:
arXiv
Saved in:
| Main Authors: | Kutrib, Martin, Malcher, Andreas, Wendlandt, Matthias |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Complexity of Unary Exclusive Nondeterministic Finite Automata
by: Kutrib, Martin, et al.
Published: (2024)
by: Kutrib, Martin, et al.
Published: (2024)
Repetitive Finite Automata With Translucent Letters
by: Mráz, František, et al.
Published: (2024)
by: Mráz, František, et al.
Published: (2024)
Explorability in Pushdown Automata
by: Bedi, Ayaan, et al.
Published: (2025)
by: Bedi, Ayaan, et al.
Published: (2025)
V-Star: Learning Visibly Pushdown Grammars from Program Inputs
by: Jia, Xiaodong, et al.
Published: (2024)
by: Jia, Xiaodong, et al.
Published: (2024)
The No Endmarker Theorem for One-Way Probabilistic Pushdown Automata
by: Yamakami, Tomoyuki
Published: (2021)
by: Yamakami, Tomoyuki
Published: (2021)
Reachability in Trace-Pushdown Systems
by: Köcher, Chris, et al.
Published: (2025)
by: Köcher, Chris, et al.
Published: (2025)
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
by: Guha, Shibashis, et al.
Published: (2021)
by: Guha, Shibashis, et al.
Published: (2021)
Unambiguous and Co-Nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters
by: Yamakami, Tomoyuki
Published: (2024)
by: Yamakami, Tomoyuki
Published: (2024)
Optimal Approximate Minimization of One-Letter Weighted Finite Automata
by: Lacroce, Clara, et al.
Published: (2023)
by: Lacroce, Clara, et al.
Published: (2023)
Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
by: Bizière, Clotilde, et al.
Published: (2024)
by: Bizière, Clotilde, et al.
Published: (2024)
Visibly Pushdown Languages in Groups
by: Ciobanu, Laura, et al.
Published: (2026)
by: Ciobanu, Laura, et al.
Published: (2026)
Universality Frontier for Asynchronous Cellular Automata
by: Baburin, Ivan, et al.
Published: (2025)
by: Baburin, Ivan, et al.
Published: (2025)
Mathematical Approach in Automata and Automata Association
by: Maciel, Sergio Henrique
Published: (2020)
by: Maciel, Sergio Henrique
Published: (2020)
History-deterministic Parikh Automata
by: Erlich, Enzo, et al.
Published: (2022)
by: Erlich, Enzo, et al.
Published: (2022)
A Bionic Natural Language Parser Equivalent to a Pushdown Automaton
by: Wei, Zhenghao, et al.
Published: (2024)
by: Wei, Zhenghao, et al.
Published: (2024)
Quantitative Language Automata
by: Henzinger, Thomas A., et al.
Published: (2025)
by: Henzinger, Thomas A., et al.
Published: (2025)
Asynchronism in Cellular Automata
by: Gautam, Virendra Kumar
Published: (2025)
by: Gautam, Virendra Kumar
Published: (2025)
On Shuffling and Splitting Automata
by: Cunningham, Ignacio Mollo
Published: (2024)
by: Cunningham, Ignacio Mollo
Published: (2024)
Explorable Parity Automata
by: Hazard, Emile, et al.
Published: (2024)
by: Hazard, Emile, et al.
Published: (2024)
Automata on Graph Alphabets
by: Bazille, Hugo, et al.
Published: (2026)
by: Bazille, Hugo, et al.
Published: (2026)
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)
Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata
by: Mazowiecki, Filip, et al.
Published: (2025)
by: Mazowiecki, Filip, et al.
Published: (2025)
Saturation Problems for Families of Automata
by: Bohn, León, et al.
Published: (2025)
by: Bohn, León, et al.
Published: (2025)
Localising Stochasticity in Weighted Automata
by: Agarwal, Smayan, et al.
Published: (2026)
by: Agarwal, Smayan, et al.
Published: (2026)
Nominal Automata with Name Deallocation
by: Prucker, Simon, et al.
Published: (2026)
by: Prucker, Simon, et al.
Published: (2026)
Determinism in Multi-Soliton Automata
by: Bordihn, Henning, et al.
Published: (2024)
by: Bordihn, Henning, et al.
Published: (2024)
Simulations for Event-Clock Automata
by: Akshay, S, et al.
Published: (2022)
by: Akshay, S, et al.
Published: (2022)
Mata, a Fast and Simple Finite Automata Library (Technical Report)
by: Chocholatý, David, et al.
Published: (2023)
by: Chocholatý, David, et al.
Published: (2023)
Learning Event-recording Automata Passively
by: Majumdar, Anirban, et al.
Published: (2025)
by: Majumdar, Anirban, et al.
Published: (2025)
Automata for the commutative closure of regular sets
by: Becher, Verónica, et al.
Published: (2025)
by: Becher, Verónica, et al.
Published: (2025)
A Unifying Approach to Picture Automata
by: Meeres, Yvo Ad, et al.
Published: (2025)
by: Meeres, Yvo Ad, et al.
Published: (2025)
Active Learning of Symbolic Mealy Automata
by: Irie, Kengo, et al.
Published: (2025)
by: Irie, Kengo, et al.
Published: (2025)
Finite Automata for Efficient Graph Recognition
by: Drewes, Frank, et al.
Published: (2024)
by: Drewes, Frank, et al.
Published: (2024)
History-Deterministic Büchi Automata are Succinct
by: Casares, Antonio, et al.
Published: (2026)
by: Casares, Antonio, et al.
Published: (2026)
Simulation Limitations of Affine Cellular Automata
by: Hudcová, Barbora, et al.
Published: (2023)
by: Hudcová, Barbora, et al.
Published: (2023)
QuAK: Quantitative Automata Kit
by: Chalupa, Marek, et al.
Published: (2024)
by: Chalupa, Marek, et al.
Published: (2024)
Safety and Liveness of Quantitative Properties and Automata
by: Boker, Udi, et al.
Published: (2023)
by: Boker, Udi, et al.
Published: (2023)
Adding Reconfiguration to Zielonka's Asynchronous Automata
by: Lehaut, Mathieu, et al.
Published: (2023)
by: Lehaut, Mathieu, et al.
Published: (2023)
Classifying Words with 3-sort Automata
by: Jastrząb, Tomasz, et al.
Published: (2024)
by: Jastrząb, Tomasz, et al.
Published: (2024)
Corrections to A Menagerie of Timed Automata
by: Keiren, Jeroen J. A., et al.
Published: (2016)
by: Keiren, Jeroen J. A., et al.
Published: (2016)
Similar Items
-
Complexity of Unary Exclusive Nondeterministic Finite Automata
by: Kutrib, Martin, et al.
Published: (2024) -
Repetitive Finite Automata With Translucent Letters
by: Mráz, František, et al.
Published: (2024) -
Explorability in Pushdown Automata
by: Bedi, Ayaan, et al.
Published: (2025) -
V-Star: Learning Visibly Pushdown Grammars from Program Inputs
by: Jia, Xiaodong, et al.
Published: (2024) -
The No Endmarker Theorem for One-Way Probabilistic Pushdown Automata
by: Yamakami, Tomoyuki
Published: (2021)