Scalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages

DOI10.1007/978-3-319-30000-9_38zbMath1443.20092OpenAlexW2293076367MaRDI QIDQ2798744

Lisa Jackson, Shang Chen, Paul C. Bell

Publication date: 13 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://dspace.lboro.ac.uk/2134/20094

zbMATH Keywords

undecidabilityfreenessbounded languagesmatrix semigroupsscalar ambiguity

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Algebraic systems of matrices (15A30)

Related Items (7)

Polynomially ambiguous probabilistic automata on restricted languages ⋮ Vector Ambiguity and Freeness Problems in SL $$(2,\mathbb {Z})$$ ⋮ On injectivity of quantum finite automata ⋮ Freeness properties of weighted and probabilistic automata over bounded languages ⋮ Relations in the semigroup of 2 × 2 upper-triangular matrices ⋮ Polynomially Ambiguous Probabilistic Automata on Restricted Languages ⋮ Acceptance Ambiguity for Quantum Automata

This page was built for publication: Scalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages