Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels

DOI10.1142/S0129054120420010zbMath1474.68176OpenAlexW2802872846MaRDI QIDQ5859660

Stavros Konstantinidis, Nelma Moreira, Joshua Young, Rogério Reis

Publication date: 19 April 2021

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054120420010

zbMATH Keywords

algorithmsautomataregular expressionsmonoidsalphabet-invariant transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

On the average complexity of partial derivative transducers ⋮ Partial derivatives of regular expressions over alphabet-invariant and user-defined labels

Uses Software

• FAdo

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
• Applications of transducers in independent languages, word distances, codes
• Symbolic finite state transducers
• A Type System for Weighted Automata and Rational Expressions
• Left and Right Synchronous Relations
• Applications of Symbolic Finite Automata
• Programming Techniques: Regular expression search algorithm
• Boolean Matrices and the Stability of Neural Nets
• Implementation and Application of Automata

This page was built for publication: Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels