Multiplicities: A deterministic view of nondeterminism

DOI10.1016/0304-3975(92)90376-QzbMath0769.68098MaRDI QIDQ1194314

Juhani Karhumäki

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

multiplicities

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Accepting networks of splicing processors: complexity results, The finest homophonic partition and related code concepts

Cites Work

• HDTOL matching of computations of multitape automata
• The equivalence problem for deterministic two-tape automata
• Systems of equations over a free monoid and Ehrenfeucht's conjecture
• The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids
• The equivalence problem of multitape finite automata
• The inclusion problem for some classes of deterministic multitape automata
• A proof of Ehrenfeucht's conjecture
• The lower central series of the free partially commutative group
• On the decidability of homomorphism equivalence for languages
• Free Associative Algebras
• Centralizers in Free Associative Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item