Glushkov Construction For Series: The Non Commutative Case

DOI10.1080/0020716021000038992zbMATH Open1033.68058OpenAlexW2041154304MaRDI QIDQ4807698FDOQ4807698

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1773075
• Characterization of Glushkov automata
• On Glushkov \(\mathbb{K}\)-graphs
• From regular expressions to finite automata^∗
• On the Average Size of Glushkov’s Automata

zbMATH Keywords

rational seriesautomata with multiplicities

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• AUTOMATE, a computing package for automata and finite semigroups
• THE ABSTRACT THEORY OF AUTOMATA
• Title not available (Why is that?)
• On the definition of a family of automata
• Title not available (Why is that?)
• Direct and dual laws for automata with multiplicities
• Programming Techniques: Regular expression search algorithm
• Regular expressions into finite automata
• From regular expressions to finite automata^∗
• From regular expressions to deterministic automata
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

• Title not available (Why is that?)
• Corrigendum to our paper: How Expressions Can Code for Automata
• Title not available (Why is that?)
• Efficient weighted expressions conversion
• On Glushkov \(\mathbb{K}\)-graphs
• From Hadamard expressions to weighted rotating automata and back
• From Hadamard expressions to weighted rotating automata and back
• Automata and rational expressions
• The net automaton of a rational expression

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4807698)