scientific article; zbMATH DE number 3254905

Cited in

(only showing first 100 items - show all)

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
Über einen Automaten mit Pufferspeicherung
State complexity of union and intersection of square and reversal on \(k\) regular languages
Complexity of multi-head finite automata: origins and directions
Adjoint machines, state-behavior machines, and duality
The complexity of asynchronous model based testing
Algorithms and topology of Cayley graphs for groups.
An alternating hierarchy for finite automata
Nondeterministic state complexity of star-free languages
The complementation problem for Büchi automata with applications to temporal logic
Finite automata and unary languages
Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata
Determinization of ordinal automata
Nondeterministic state complexity of star-free languages
Tree acceptors and some of their applications
Reversal of binary regular languages
Distances between languages and reflexivity of relations
An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton
Rigorous approximated determinization of weighted automata
Minimisation of acyclic deterministic automata in linear time
Size Complexity of Two-Way Finite Automata
The theory of languages
An algebraic characterization of deterministic regular languages over infinite alphabets.
Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata
Pairs of complementary unary languages with ``balanced nondeterministic automata
Powers of Regular Languages
Tighter Bounds for the Determinisation of Büchi Automata
Partial derivatives of regular expressions and finite automaton constructions
The equivalence problem of multitape finite automata
Automatic groups and amalgams
Regular languages and Stone duality
Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs
Loops in automata and HDTOL relations
Fuzzy automata and languages
State-complexity of finite-state devices, state compressibility and incompressibility
Complexity of promise problems on classical and quantum automata
Coping with selfish on-going behaviors
The equivalence problem of multidimensional multitape automata
Communication complexity method for measuring nondeterminism in finite automata
Rewriting of regular expressions and regular path queries
Finite automata theory with membership values in lattices
Automatic construction of test sets: theoretical approach
Testing conformance of a deterministic implementation against a non-deterministic stream X-machine
The inclusion problem for simple languages
A family of NFAs which need 2\(^{n}-\alpha\) deterministic states
Real-time computations with restricted nondeterminism
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
Finite-memory automata
Prognosis of \(\omega\)-languages for the diagnosis of *-languages: a topological perspective
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

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)