Simulation by Rounds of Letter-to-Letter Transducers

DOI10.46298/lmcs-19(4:19)2023arXiv2105.01512MaRDI QIDQ6178697

Unnamed Author, Shaull Almagor

Publication date: 16 January 2024

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.01512

zbMATH Keywords

permutationsequivalencesimulationtransducersParikh

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• On NFAs where all states are final, initial, or both
• A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
• State complexity bounds for the commutative closure of group languages
• Characterizations of locally testable events
• Regular Symmetry Patterns
• Jumping Finite Automata: Characterizations and Complexity
• Bounds on Positive Integral Solutions of Linear Diophantine Equations
• Handbook of Model Checking
• JUMPING FINITE AUTOMATA
• On Context-Free Languages
• Fair simulation