Decomposing regular languages under shuffle along trajectories
From MaRDI portal
Cites work
- Alternating finite automata on -words
- Concurrent regular expressions and their relationship to Petri nets
- Decidability of trajectory-based equations
- Deletion along trajectories
- scientific article; zbMATH DE number 1916664 (Why is no real title available?)
- scientific article; zbMATH DE number 2201361 (Why is no real title available?)
- Language-theoretic problems arising from Richelieu cryptosystems
- Mappings of languages by two-tape devices
- Modalities for model checking: Branching time logic strikes back
- On Decompositions of Regular Events
- On language decompositions and primality
- On the existence of prime decompositions
- Optimizing Schema Languages for XML: Numerical Constraints and Interleaving
- RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS
- Shuffle Expressions and Words with Nested Data
- Shuffle languages are in P
- Shuffle languages, Petri nets, and context-sensitive grammars
- Shuffle on trajectories: Syntactic constraints
- Thin and slender languages
This page was built for publication: Decomposing regular languages under shuffle along trajectories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443172)