scientific article
From MaRDI portal
Publication:4036562
zbMath0766.68098MaRDI QIDQ4036562
Jānis Kaņeps, Rūsiņš Freivalds
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
regular languagelanguage recognition2-dimensional languagesnonregular language2-way probabilistic finite automata
Related Items (8)
Automaticity. II: Descriptional complexity in the unary case ⋮ Reducing Acyclic Cover Transducers ⋮ Probabilistic asynchronous automata ⋮ Automaticity. IV: Sequences, sets, and diversity ⋮ Similarity relations and cover automata ⋮ Minimal cover-automata for finite languages ⋮ Characterizations of one-way general quantum finite automata ⋮ Two-way finite automata with quantum and classical states.
This page was built for publication: