The net automaton of a rational expression
From MaRDI portal
Publication:6109019
DOI10.1007/978-3-031-20624-5_23MaRDI QIDQ6109019
Sylvain Lombardy, Jacques Sakarovitch
Publication date: 26 July 2023
Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Handbook of weighted automata
- Regular expressions into finite automata
- Derivatives of rational expressions with multiplicity
- Automata and rational expressions
- Matrix and matricial iteration theories. I
- Automata and languages generalized to \(\omega\)-continuous semirings
- THE VALIDITY OF WEIGHTED AUTOMATA
- On the definition of a family of automata
- THE ABSTRACT THEORY OF AUTOMATA
- FROM REGULAR WEIGHTED EXPRESSIONS TO FINITE AUTOMATA
- Glushkov Construction For Series: The Non Commutative Case
- From regular expressions to finite automata∗
- Rational and Recognisable Power Series
- Programming Techniques: Regular expression search algorithm
- Probabilistic automata
- A Unified Construction of the Glushkov, Follow, and Antimirov Automata
- Handbook of Automata Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The net automaton of a rational expression
