Glushkov Construction For Series: The Non Commutative Case

DOI10.1080/0020716021000038992zbMath1033.68058OpenAlexW2041154304MaRDI QIDQ4807698

Pascal Caron, Marianne Flouret

Publication date: 26 May 2003

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020716021000038992

zbMATH Keywords

automata with multiplicitiesrational series

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

The net automaton of a rational expression ⋮ Efficient weighted expressions conversion ⋮ Corrigendum to our paper: How Expressions Can Code for Automata ⋮ From Hadamard expressions to weighted rotating automata and back ⋮ From Hadamard expressions to weighted rotating automata and back ⋮ Automata and rational expressions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• From regular expressions to deterministic automata
• AUTOMATE, a computing package for automata and finite semigroups
• Regular expressions into finite automata
• On the definition of a family of automata
• THE ABSTRACT THEORY OF AUTOMATA
• From regular expressions to finite automata^∗
• Programming Techniques: Regular expression search algorithm
• Direct and dual laws for automata with multiplicities

This page was built for publication: Glushkov Construction For Series: The Non Commutative Case