Computing with relational machines
From MaRDI portal
Publication:5269008
DOI10.1017/S0960129515000390zbMATH Open1364.68202OpenAlexW2605828604MaRDI QIDQ5269008FDOQ5269008
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
Recommendations
Cites Work
- A functional toolkit for morphological and phonological processing, application to a Sanskrit tagger
- FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
- Derivatives of Regular Expressions
- Partial derivatives of regular expressions and finite automaton constructions
- Title not available (Why is that?)
- A completeness theorem for Kleene algebras and the algebra of regular events
- Title not available (Why is that?)
- Follow automata.
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- A Unified Construction of the Glushkov, Follow, and Antimirov Automata
- A play on regular expressions
- Programming Techniques: Regular expression search algorithm
- The next 700 programming languages
- Title not available (Why is that?)
- Regular expressions into finite automata
- Canonical derivatives, partial derivatives and finite automaton constructions.
- FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON
- From regular expressions to deterministic automata
- Finite Eilenberg Machines
- Simulating Finite Eilenberg Machines with a Reactive Engine
- The Reactive Engine for Modular Transducers
Cited In (4)
Uses Software
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)
