Computing with relational machines

DOI10.1017/S0960129515000390zbMath1364.68202OpenAlexW2605828604MaRDI QIDQ5269008

Gérard Huet, Benoît Razet

Publication date: 14 June 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129515000390

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Uses Software

• Zen

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• From regular expressions to deterministic automata
• Partial derivatives of regular expressions and finite automaton constructions
• Regular expressions into finite automata
• A completeness theorem for Kleene algebras and the algebra of regular events
• Follow automata.
• Canonical derivatives, partial derivatives and finite automaton constructions.
• A functional toolkit for morphological and phonological processing, application to a Sanskrit tagger
• Finite Eilenberg Machines
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
• Simulating Finite Eilenberg Machines with a Reactive Engine
• A play on regular expressions
• FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON
• The next 700 programming languages
• Programming Techniques: Regular expression search algorithm
• Derivatives of Regular Expressions
• A Unified Construction of the Glushkov, Follow, and Antimirov Automata
• The Reactive Engine for Modular Transducers