Regular algebra applied to language problems
From MaRDI portal
Publication:817577
DOI10.1016/J.JLAP.2005.04.008zbMATH Open1086.68069OpenAlexW2078433343WikidataQ114851565 ScholiaQ114851565MaRDI QIDQ817577FDOQ817577
Authors: Roland C. Backhouse 
Publication date: 16 March 2006
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2005.04.008
Recommendations
fixed pointGalois connectionprogramming methodologylanguage inclusionfactor matrixfactor theorypath-findingproblem generalisation
Cites Work
- A note on two problems in connexion with graphs
- Title not available (Why is that?)
- A Theorem on Boolean Matrices
- Galois Connexions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Minimum Distance Error-Correcting Parser for Context-Free Languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast Pattern Matching in Strings
- A completeness theorem for Kleene algebras and the algebra of regular events
- Some Galois connections in elementary number theory
- Unifying theories for logic programming
- The Mathematics of Sentence Structure
- Title not available (Why is that?)
- Non-Commutative Residuated Lattices
- A generalization of Dijkstra's algorithm
- Systematic design of program transformation frameworks by abstract interpretation
- Regular Algebra Applied to Path-finding Problems
- Beiträge zur Filtertheorie. II
- A Shortest Path Algorithm for Edge-Sparse Graphs
- Fixed point theorems and semantics: A folk tale
- A Unified Approach to Path Problems
- A calculational approach to reactive systems
- Safety of abstract interpretations for free, via logical relations and Galois connections
- Incremental execution of transformation specifications
- Title not available (Why is that?)
- Pair algebra and its application to automata theory
Cited In (12)
- Regular languages and their generating functions: The inverse problem
- Factor theory and the unity of opposites
- Recursive functions of context free languages
- INDUCTIVE COMPOSITION OF NUMBERS WITH MAXIMUM, MINIMUM, AND ADDITION: A New Theory for Program Execution-Time Analysis
- Solving Linear Equations in *-continuous Action Lattices
- Title not available (Why is that?)
- The Capacity-C Torch Problem
- Algebraic Methodology and Software Technology
- An algebraic framework for multi-objective and robust variants of path problems
- Components and acyclicity of graphs. An exercise in combining precision with concision
- On difunctions
- Title not available (Why is that?)
Uses Software
This page was built for publication: Regular algebra applied to language problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817577)
