Computing with relational machines
From MaRDI portal
Publication:5269008
Recommendations
Cites work
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 549971 (Why is no real title available?)
- scientific article; zbMATH DE number 3244305 (Why is no real title available?)
- A Unified Construction of the Glushkov, Follow, and Antimirov Automata
- A completeness theorem for Kleene algebras and the algebra of regular events
- A functional toolkit for morphological and phonological processing, application to a Sanskrit tagger
- A play on regular expressions: functional pearl
- Canonical derivatives, partial derivatives and finite automaton constructions.
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Derivatives of Regular Expressions
- FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
- FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON
- Finite Eilenberg Machines
- Follow automata.
- From regular expressions to deterministic automata
- Partial derivatives of regular expressions and finite automaton constructions
- Programming Techniques: Regular expression search algorithm
- Regular expressions into finite automata
- Simulating finite Eilenberg machines with a reactive engine
- The Reactive Engine for Modular Transducers
- The next 700 programming languages
Cited in
(7)
This page was built for publication: Computing with relational machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5269008)