Computing the prefix of an automaton
type: Item
instance of: scholarly article
title: Computing the prefix of an automaton
zbMATH Open document ID: 0974.68105
author: Marie-Pierre Béal
author: Olivier Carton
publication date: 2001-07-23T00:00:00Z
full work available at URL: https://eudml.org/doc/222063
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1623092
zbMATH Keywords: prefix of an automaton
MaRDI profile type: Publication
OpenAlex ID: W1978825867
cites work: Q4091421
cites work: Q3859267
cites work: The suffix tree of a tree and minimizing sequential transducers
cites work: Q3853135
cites work: Q3619797
cites work: Confluent linear numeration systems
cites work: Minimization algorithms for sequential transducers
DOI: 10.1051/ITA:2000127
Recommended article: Complexity of automata computing values of functions given in the prefix form
Recommended article: Implementation and Application of Automata
Recommended article: Prefix pushdown automata and their simplification
Recommended article: Automata calculating the complexity of automatic sequences
Recommended article: Prefix-suffix automaton associated with a primitive substitution
Recommended article: Q5061515
Recommended article: Prefix and Right-Partial Derivative Automata
Recommended article: Prefix codes, trees, and automata
Recommended article: Complexity of Preimage Problems for Deterministic Finite Automata
Recommended article: Preimage problems for deterministic finite automata
published in: RAIRO. Theoretical Informatics and Applications
description: scientific article; zbMATH DE number 1623092