Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

scientific article; zbMATH DE number 4769

From MaRDI portal
Publication:4712653
Jump to:navigation, search

zbMATH Open0751.68039MaRDI QIDQ4712653

Arto Salomaa

Publication date: 25 June 1992



Title of this publication is not available (Why is that?)


zbMATH Keywords

equivalencefinite automataformal seriesPost Correspondence Problem


Mathematics Subject Classification ID

Formal languages and automata (68Q45) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)



Related Items (10)

Recognizability for automata ⋮ Computational complexity of decision problems on self-verifying finite automata ⋮ Title not available (Why is that?) ⋮ Determinism and Nondeterminism in Finite Automata with Advice ⋮ A criterion for the decidability of the \(A\)-completeness problem for definite automata ⋮ Deciding properties of integral relational automata ⋮ Decidability problems for unary output sequential transducers ⋮ Automata for a decidable subset of duration calculus. ⋮ Title not available (Why is that?) ⋮ Decision Problems for Finite Automata over Infinite Algebraic Structures






This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4712653)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4712653&oldid=11995888"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 00:21.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki