Automata and rational expressions
type: Item
instance of: scholarly article
title: Automata and rational expressions
author: Jacques Sakarovitch
publication date: 2022-02-04T00:00:00Z
full work available at URL: https://arxiv.org/abs/1502.03573
review text: Summary: For the entire collection see [Zbl 1470.68001].
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 7469500
describes a project that uses: Algorithm 97
describes a project that uses: LANGAGE
describes a project that uses: Stamina
MaRDI profile type: Publication
cites work: ON THE STRUCTURE OF FINITELY GENERATED SEMIGROUPS OF UNARY REGULAR LANGUAGES
cites work: A Unified Construction of the Glushkov, Follow, and Antimirov Automata
cites work: On the number of broken derived terms of a rational expression
cites work: Partial derivatives of regular expressions and finite automaton constructions
cites work: Conjugacy and Equivalence of Weighted Automata and Functional Transducers
cites work: From regular expressions to deterministic automata
cites work: Q3859267
cites work: Local languages and the Berry-Sethi algorithm
cites work: Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids
cites work: Q3994777
cites work: Regular expressions into finite automata
cites work: Derivatives of Regular Expressions
cites work: Boolean Matrices and the Stability of Neural Nets
cites work: Glushkov Construction For Series: The Non Commutative Case
cites work: Characterization of Glushkov automata
cites work: From Mirkin's prebases to Antimirov's word partial derivatives
cites work: Canonical derivatives, partial derivatives and finite automaton constructions.
cites work: Q5526125
cites work: The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem
cites work: Q5639639
cites work: Implementation and Application of Automata
cites work: Handbook of weighted automata
cites work: Transition graphs and the star-height of regular events
cites work: Q4079524
cites work: On Relations Defined by Generalized Finite Automata
cites work: Stamina: stabilisation monoids in automata theory
cites work: Multitape one-way nonwriting automata
cites work: A play on regular expressions
cites work: 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)
cites work: Semigroups, Presburger formulas, and languages
cites work: Short Regular Expressions from Finite Automata: Empirical Results
cites work: Algorithms for determining relative star height and star height
cites work: Follow automata.
cites work: Distance desert automata and the star height problem
cites work: Automata Studies. (AM-34)
cites work: Complete systems of \(\mathcal B\)-rational identities
cites work: DIFFERENTIATION OF K-RATIONAL EXPRESSIONS
cites work: Q3704880
cites work: Derivatives of rational expressions with multiplicity
cites work: How expressions can code for automata
cites work: The validity of weighted automata
cites work: Kleene quotient theorems
cites work: Q5536277
cites work: Easy multiplications. II: Extensions of rational semigroups
cites work: Q5541339
cites work: Q3267904
cites work: On commutative Kleene monoids
cites work: Q4938650
cites work: Behavioural differential equations: a coinductive calculus of streams, automata, and power series
cites work: Easy multiplications. I: The realm of Kleene's theorem
cites work: Q4155837
cites work: On the definition of a family of automata
cites work: Programming Techniques: Regular expression search algorithm
cites work: A Theorem on Boolean Matrices
OpenAlex ID: W4206784924
DOI: 10.4171/AUTOMATA-1/2
description: scientific article; zbMATH DE number 7469500