scientific article; zbMATH DE number 176733

zbMATH Open0766.68098MaRDI QIDQ4036562FDOQ4036562

Authors: Jānis Kaņeps, Rūsiņš Freivalds 

Publication date: 18 May 1993

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

Recommendations

• A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
• A note on two-way probabilistic automata
• scientific article; zbMATH DE number 1857649
• scientific article; zbMATH DE number 1318511
• Stochasticity of the languages acceptable by two-way finite probabilistic automata

zbMATH Keywords

regular languagelanguage recognition2-dimensional languagesnonregular language2-way probabilistic finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Cited In (13)

• Similarity relations and cover automata
• Automaticity. II: Descriptional complexity in the unary case
• Characterizations of one-way general quantum finite automata
• Title not available (Why is that?)
• Probabilistic asynchronous automata
• Two-way finite automata with quantum and classical states.
• Reducing Acyclic Cover Transducers
• Minimal cover-automata for finite languages
• A note on two-way probabilistic automata
• TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES
• Automaticity. IV: Sequences, sets, and diversity
• A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
• A lower bound for probabilistic algorithms for finite state machines

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