Automata and rational expressions
From MaRDI portal
Publication:2074204
DOI10.4171/Automata-1/2OpenAlexW4206784924MaRDI QIDQ2074204
Publication date: 4 February 2022
Full work available at URL: https://arxiv.org/abs/1502.03573
Related Items (5)
Manipulation of regular expressions using derivatives: an overview ⋮ The net automaton of a rational expression ⋮ Topologies for error-detecting variable-length codes ⋮ Adding pebbles to weighted automata: easy specification \& efficient evaluation ⋮ Partial derivatives of regular expressions over alphabet-invariant and user-defined labels
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- From regular expressions to deterministic automata
- Partial derivatives of regular expressions and finite automaton constructions
- Local languages and the Berry-Sethi algorithm
- Handbook of weighted automata
- Easy multiplications. II: Extensions of rational semigroups
- Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids
- Easy multiplications. I: The realm of Kleene's theorem
- Algorithms for determining relative star height and star height
- On commutative Kleene monoids
- Complete systems of \(\mathcal B\)-rational identities
- Regular expressions into finite automata
- Follow automata.
- Characterization of Glushkov automata
- Derivatives of rational expressions with multiplicity
- Canonical derivatives, partial derivatives and finite automaton constructions.
- Behavioural differential equations: a coinductive calculus of streams, automata, and power series
- Stamina: stabilisation monoids in automata theory
- Semigroups, Presburger formulas, and languages
- Kleene quotient theorems
- Multitape one-way nonwriting automata
- Transition graphs and the star-height of regular events
- Deux applications de la représentation matricielle d'une série rationnelle non commutative. (Two applications of matrix representations of a rational non -commutative series)
- THE VALIDITY OF WEIGHTED AUTOMATA
- ON THE STRUCTURE OF FINITELY GENERATED SEMIGROUPS OF UNARY REGULAR LANGUAGES
- Automata Studies. (AM-34)
- On the definition of a family of automata
- Conjugacy and Equivalence of Weighted Automata and Functional Transducers
- The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem
- Short Regular Expressions from Finite Automata: Empirical Results
- DIFFERENTIATION OF K-RATIONAL EXPRESSIONS
- How expressions can code for automata
- Glushkov Construction For Series: The Non Commutative Case
- A play on regular expressions
- Distance desert automata and the star height problem
- Implementation and Application of Automata
- On Relations Defined by Generalized Finite Automata
- Programming Techniques: Regular expression search algorithm
- Derivatives of Regular Expressions
- A Theorem on Boolean Matrices
- Boolean Matrices and the Stability of Neural Nets
- A Unified Construction of the Glushkov, Follow, and Antimirov Automata
- Implementation and Application of Automata
This page was built for publication: Automata and rational expressions
