Decidability of Skolem matrix emptiness problem entails constructability of exact regular expression
From MaRDI portal
Publication:1171048
DOI10.1016/0304-3975(82)90134-7zbMath0498.03008OpenAlexW2062562500MaRDI QIDQ1171048
Publication date: 1982
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(82)90134-7
exact algorithmrecursivenessequivalence problem modulo finite setfull matrix equivalence probleminteger-valued square matrix
Undecidability and degrees of sets of sentences (03D35) Artificial intelligence (68T99) Decidability of theories and sets of sentences (03B25)
Cites Work
- Unnamed Item
- Unnamed Item
- What makes some language theory problems undecidable
- On a Theorem of R. Jungen
- Deux propriétés décidables des suites récurrentes linéaires
- Fuzzy events realized by finite probabilistic automata
- Mappings induced by PGSM-mappings and some recursively unsolvable problems of finite probabilistic automata
- On stochastic languages
This page was built for publication: Decidability of Skolem matrix emptiness problem entails constructability of exact regular expression