Cover Image

Note on dissecting power of regular languages

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Rukavicka, Josef
Format:	Preprint
Published:	2023
Subjects:	Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Dissecting power of intersection of two context-free languages
by: Rukavicka, Josef
Published: (2020)

Restivo Salemi property for $α$-power free languages with $α\geq 5$ and $k\geq 3$ letters
by: Rukavicka, Josef
Published: (2023)

Navigational hierarchies of regular languages
by: Place, Thomas, et al.
Published: (2024)

Notes on Stack Machines and Quantum Stack Machines
by: Qiu, Daowen
Published: (2025)

On state complexity for subword-closed languages
by: Guyot, Jérôme
Published: (2024)

Automata for the commutative closure of regular sets
by: Becher, Verónica, et al.
Published: (2025)

Two-way affine automata can verify every language
by: Chen, Zeyu, et al.
Published: (2025)

A pumping-like lemma for languages over infinite alphabets
by: Danieli, Yoav
Published: (2025)

A short survey around the pumping lemma for context-free languages
by: Gullà, Gabriele
Published: (2024)

$ω$-regular Expression Synthesis from Transition-Based Büchi Automata
by: Pert, Charles, et al.
Published: (2024)

Quantum finite automata and linear context-free languages: a decidable problem
by: Bertoni, A., et al.
Published: (2013)

Characterization of deterministically recognizable weighted tree languages over commutative semifields by finitely generated and cancellative scalar algebras
by: Fülöp, Zoltán, et al.
Published: (2025)

Watson-Crick conjugates of words and languages
by: Mahalingam, Kalpana, et al.
Published: (2022)

Automata-based constraints for language model decoding
by: Koo, Terry, et al.
Published: (2024)

Recursive numeral systems are highly regular and easy to process
by: Prasertsom, Ponrawee, et al.
Published: (2025)

Geodesic languages for rational subsets and conjugates in virtually free groups
by: Carvalho, André, et al.
Published: (2024)

Sequential densities of rational languages
by: Gorman, Alexi Block, et al.
Published: (2026)

Regular language quantum states
by: Florido-Llinàs, Marta, et al.
Published: (2024)

An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)

A cartesian closed fibration of higher-order regular languages
by: Melliès, Paul-André, et al.
Published: (2026)

Twinning automata and regular expressions for string static analysis
by: Negrini, Luca, et al.
Published: (2020)

The Expansion Problem for Infinite Trees
by: Blumensath, Achim
Published: (2023)

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

Simulation Limitations of Affine Cellular Automata
by: Hudcová, Barbora, et al.
Published: (2023)

On the Expressive Power of Regular Expressions with Backreferences
by: Nogami, Taisei, et al.
Published: (2023)

Safety and Liveness of Quantitative Properties and Automata
by: Boker, Udi, et al.
Published: (2023)

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

Checking History-Determinism is NP-hard for Parity Automata
by: Prakash, Keya
Published: (2023)

Closure Properties of General Grammars -- Formally Verified
by: Dvorak, Martin, et al.
Published: (2023)

A Linear-time Simulation of Deterministic $d$-Limited Automata
by: Rubtsov, Alexander
Published: (2023)

Reset thresholds of transformation monoids
by: Rystsov, Igor, et al.
Published: (2023)

Closure and Decision Properties for Higher-Dimensional Automata
by: Amrane, Amazigh, et al.
Published: (2023)

Deciding Linear Height and Linear Size-to-Height Increase for Macro Tree Transducers
by: Gallot, Paul, et al.
Published: (2023)

Constructing Deterministic Parity Automata from Positive and Negative Examples
by: Bohn, León, et al.
Published: (2023)

Black-box Testing Liveness Properties of Partially Observable Stochastic Systems
by: Esparza, Javier, et al.
Published: (2023)

Deciding whether an Attributed Translation can be realized by a Top-Down Transducer
by: Maneth, Sebastian, et al.
Published: (2023)

Adding Reconfiguration to Zielonka's Asynchronous Automata
by: Lehaut, Mathieu, et al.
Published: (2023)

On Decidability and Expressive Power of Fusion Grammars
by: Pshenitsyn, Tikhon
Published: (2023)

A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation
by: Akshay, S, et al.
Published: (2023)

Invariants and Home Spaces in Transition Systems and Petri Nets
by: Memmi, Gerard
Published: (2023)