scientific article; zbMATH DE number 3254905

Cited in

(only showing first 100 items - show all)

Equivalence of regular expressions over a partially commutative alphabet
On input-revolving deterministic and nondeterministic finite automata
A characterization of automata and a direct product decomposition
Nondeterministic complexity in subclasses of convex languages
scientific article; zbMATH DE number 3305096 (Why is no real title available?)
Notes on finitely generated semigroups and pumping conditions for regular languages
Equivalence of infinite behavior of finite automata
Modeling of RNA secondary structures using two-way quantum finite automata
Finite transducers and rational transductions
Substitution in families of languages
A note on Parikh maps, abstract languages, and decision problems
AFL with the semilinear property
Fuzzy neural networks
Projections of languages recognizable by probabilistic and alternating finite multitape automata
Sequential fuzzy system identification
Finite automata with multiplication
Automata theory and control theory - a rapprochement
Concatenation of Regular Languages and Descriptional Complexity
Controlled pushdown automata
On the representation of finite deterministic 2-tape automata
Endmarkers can make a difference
New techniques for proving the decidability of equivalence problem
Parallel complexity of the regular code problem
Polynomial algorithm for equivalence problem of deterministic multitape finite automata
Modelization of deterministic rational relations
Alternating states for dual nondeterminism in imperative programming
System identification via state characterization
A note on autodense related languages
On a subclass of \(\infty\)-regular languages
Decision problems among the main subfamilies of rational relations
The finite automata approaches in stringology
Quasi-automatic semigroups
Maximin, Minimax, and composite sequential machines
Alternation and bounded concurrency are reverse equivalent.
Finite automata on directed graphs
Prefix-free languages: left and right quotient and reversal
On size reduction techniques for multitape automata
A hierarchy of deterministic languages
The complexity of concatenation on deterministic and alternating finite automata
Direct and subdirect product structure theorems for non-deterministic automata
Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
On the power of two-way multihead quantum finite automata
Quasiidentities in a free semigroup
scientific article; zbMATH DE number 7003194 (Why is no real title available?)
On inclusion problem for deterministic multitape automata
A note on decision problems for three-way two-dimensional finite automata
Solvable classes of discrete dynamic programming
Multiplicities: A deterministic view of nondeterminism
Some decision problems concerning sequential transducers and checking automata
The Complexity of Languages Resulting from the Concatenation Operation
On the transformation semigroups of finite automata
Vector addition systems and regular languages
Operations on Permutation Automata
Profile trees for Büchi word automata, with application to determinization
The ``equal last letter predicate for words on infinite alphabets and classes of multitape automata
Domain mu-calculus
Automata theory and model checking
The problem of equivalent transformations for homogeneous multitape automata
Descriptional and computational complexity of finite automata -- a survey
Equivalence in automata theory based on complete residuated lattice-valued logic
Bounded Regular Sets
Spiking Neural P Systems with Thresholds
Theory of átomata
On Stateless Deterministic Restarting Automata
More concise representation of regular languages by automata and regular expressions
The Unmet Challenge of Timed Systems
Homomorphisms of algebras
On the relevance of abstract algebra to control theory
Parallel program schemata
Two-Way Automata in Coq
Polynomial complete problems in automata theory
State complexity of star of union and square of union on \textit{k} regular languages
A note on the reduction of two-way automata to one-way automata
Complementing unary nondeterministic automata
Stimulus-response theory of inite automata
Decision Problems of Finite Automata Design and Related Arithmetics
Weak Second‐Order Arithmetic and Finite Automata
Determination of finite automata accepting subregular languages
Theories of automata on \(\omega\)-tapes: a simplified approach
On multi-head automata with restricted nondeterminism
Simple counter machines and number-theoretic problems
State complexity of some operations on binary regular languages
On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's
The partial clone of linear tree languages
Myhill-Nerode type theory for fuzzy languages and automata
Optimal simulation of self-verifying automata by deterministic automata
Size complexity of rotating and sweeping automata
The state complexity of \(L^{2}\) and \(L^k\)
Regular languages with variables on graphs
Comparing the size of NFAs with and without \(\epsilon\)-transitions
Nondeterministic fuzzy automata
State complexity of union and intersection of star on \(k\) regular languages
Boolean language operations on nondeterministic automata with a pushdown of constant height
Checking experiments for stream X-machines
Descriptional complexity of input-driven pushdown automata
Deterministic blow-ups of minimal NFA's
State complexity of four combined operations composed of union, intersection, star and reversal
Magic numbers in the state hierarchy of finite automata
Program schemes, recursion schemes, and formal languages
Complementing deterministic Büchi automata in polynomial time

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