scientific article; zbMATH DE number 1088283

zbMATH Open0884.68075MaRDI QIDQ4364599FDOQ4364599

Authors: Dainis Geidmanis, Jānis Kaņeps, Daina Taimina, Elena Calude, Kalvis Apsītis 

Publication date: 17 March 1998

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

Recommendations

• On tally languages and generalized interacting automata
• Alternating Turing machines for inductive languages
• scientific article; zbMATH DE number 1408339
• Alternating finite automata and star-free languages
• scientific article; zbMATH DE number 4047169
• Language acceptability of finite automata based on theory of semi-tensor product of matrices
• Tabulation of automata for tree-adjoining languages
• Language equations for timed alternating finite automata
• scientific article; zbMATH DE number 4020506
• Alternating multihead finite automata

zbMATH Keywords

finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (2)

• Alternating finite automata with limited universal branching
• Alternating simple multihead finite automata

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 Q4364599)