Bideterministic weighted automata
From MaRDI portal
Publication:6108730
DOI10.1007/978-3-031-19685-0_12arXiv2303.10631OpenAlexW4313062722MaRDI QIDQ6108730
Publication date: 26 July 2023
Published in: Algebraic Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.10631
Related Items (1)
Cites Work
- 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
- On viewing block codes as finite automata.
- Noncommutative rational Pólya series
- Determinisability of unary weighted automata over the rational numbers
- What's decidable about weighted automata?
- Weighted automata
- Nondeterministic syntactic complexity
- An algebraic characterization of semirings for which the support of every recognizable series is recognizable
- Sequential?
- Inverse Monoids of Higher-Dimensional Strings
- On the definition of a family of automata
- Conjugacy and Equivalence of Weighted Automata and Functional Transducers
- Bideterministic Automata and Minimal Representations of Regular Languages
- Inference of Reversible Languages
- Rational and Recognisable Power Series
- Weighted Automata Algorithms
- Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
- The loop complexity of pure-group events
- MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON
- Automata, Languages and Programming
This page was built for publication: Bideterministic weighted automata
