Freeness properties of weighted and probabilistic automata over bounded languages
From MaRDI portal
Publication:2280319
DOI10.1016/j.ic.2019.104440zbMath1435.68143OpenAlexW2970776178MaRDI QIDQ2280319
Shang Chen, Lisa Jackson, Paul C. Bell
Publication date: 18 December 2019
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: http://researchonline.ljmu.ac.uk/id/eprint/7185/1/BelCheJac16revise2.pdf
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items
Special issue: selected papers of the 10th international conference on language and automata theory and applications, LATA 2016, Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reachability problems in quaternion matrix and rotation semigroups
- Decision problems concerning thinness and slenderness of formal languages
- Some consequences of a Fatou property of the tropical semiring
- Undecidable problems for probabilistic automata of fixed dimension
- The freeness problem over matrix semigroups and bounded languages
- Scalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages
- On the decidability of semigroup freeness
- UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES
- What’s Decidable about Weighted Automata?
- MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM
- THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
- ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS
- Some decision problems on integer matrices
- Decision Problems for Probabilistic Finite Automata on Bounded Languages
- Periodic and Infinite Traces in Matrix Semigroups
- Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages
- Generalized Automata and Stochastic Languages
- Unsolvability in 3 × 3 Matrices
- Automata, Languages and Programming
- ON THE UNDECIDABILITY OF THE FREENESS OF INTEGER MATRIX SEMIGROUPS
