DeepAI AI Chat
Log In Sign Up

Glushkov's construction for functional subsequential transducers

Glushkov's construction has many interesting properties and they become even more evident when applied to transducers. This article strives to show the wast range of possible extensions and optimisations for this algorithm. Special flavour of regular expressions is introduced, which can be efficiently converted to ϵ-free functional subsequential weighted finite state transducers. Produced automata are very compact, as they contain only one state for each symbol (from input alphabet) of original expression and only one transition for each range of symbols, no matter how large. Such compactified ranges of transitions allow for efficient binary search lookup during automaton evaluation. All the methods and algorithms presented here were used to implement open-source compiler of regular expressions for multitape transducers.


page 1

page 2

page 3

page 4


Structure-Constrained Process Graphs for the Process Semantics of Regular Expressions

Milner (1984) introduced a process semantics for regular expressions as ...

Model Checking Regular Language Constraints

Even the fastest SMT solvers have performance problems with regular expr...

The Image of the Process Interpretation of Regular Expressions is Not Closed under Bisimulation Collapse

Axiomatization and expressibility problems for Milner's process semantic...

Deterministic Regular Expressions With Back-References

Most modern libraries for regular expression matching allow back-referen...

Extending Functional Languages with High-Level Exception Handling

We extend functional languages with high-level exception handling. To be...

On the Intersection of Context-Free and Regular Languages

The Bar-Hillel construction is a classic result in formal language theor...

A closer look at TDFA

We present an algorithm for regular expression parsing and submatch extr...