Bideterministic weighted automata
From MaRDI portal
Publication:6186321
DOI10.1016/j.ic.2023.105093OpenAlexW4386954674MaRDI QIDQ6186321
Publication date: 2 February 2024
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2023.105093
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Presentations of inverse monoids
- Bideterministic automata and minimal representations of regular languages
- Handbook of weighted automata
- Determinization of weighted finite automata over strong bimonoids
- The zero-divisor graph of a commutative ring
- On viewing block codes as finite automata.
- Zero divisor graphs of semigroups.
- Noncommutative rational Pólya series
- Determinisability of unary weighted automata over the rational numbers
- What's decidable about weighted automata?
- Weighted automata
- Max-plus automata
- Nondeterministic syntactic complexity
- An algebraic characterization of semirings for which the support of every recognizable series is recognizable
- Sequential?
- THE ZERO-DIVISOR GRAPHS OF RINGS AND SEMIRINGS
- Zero-divisor graphs in commutative rings
- On the definition of a family of automata
- Conjugacy and Equivalence of Weighted Automata and Functional Transducers
- ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA
- Bideterministic Automata and Minimal Representations of Regular Languages
- Inference of Reversible Languages
- Rational and Recognisable Power Series
- The loop complexity of pure-group events
- MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON
- Automata, Languages and Programming
- Bideterministic weighted automata
This page was built for publication: Bideterministic weighted automata
