scientific article; zbMATH DE number 3254905

Cited in

(only showing first 100 items - show all)

Magic Numbers and Ternary Alphabet
Complexity of multi-head finite automata: origins and directions
Both ways rational functions
Modelization of deterministic rational relations
Control sets on grammars
A hierarchy of deterministic languages
The theory of languages
Distances between languages and reflexivity of relations
On the descriptional complexity of finite automata with modified acceptance conditions
Oblivious DFA evaluation on joint input and its applications
Angelic processes for CSP via the UTP
Quasi-automatic semigroups
Tighter Bounds for the Determinisation of Büchi Automata
Myhill-Nerode type theory for fuzzy languages and automata
An alternating hierarchy for finite automata
Nondeterministic state complexity of star-free languages
Checking experiments for stream X-machines
The equivalence problem for deterministic two-tape automata
Descriptional complexity of the forever operator
A new hierarchy for automaton semigroups
Maximin, Minimax, and composite sequential machines
On probabilistic analog automata
More on deterministic and nondeterministic finite cover automata
Regular sets and finite automata over?-groups
Optimal simulation of self-verifying automata by deterministic automata
Nondeterministic state complexity of star-free languages
Geodesic growth in virtually abelian groups
Free and almost-free subsemigroups of a free semigroup
The theory of languages
Membrane automata for modeling biomolecular processes
Regular languages and Stone duality
Fuzzy automata and languages
Oblivious two-way finite automata: decidability and complexity
An asymmetric regular set
Programs=data=first-class citizens in a computational world
On a characterization of the nonregular set of primes
Syntactic operators on full semiAFLs
REF-ARF: A system for solving problems stated as procedures
Finite transducers and rational transductions
The inclusion problem for some classes of deterministic multitape automata
Formalization of the concept of multitape automaton
The equivalence problem of multitape finite automata
Descriptional complexity of limited automata
Magic numbers in the state hierarchy of finite automata
Multiplicities: A deterministic view of nondeterminism
Transfer of model checking to industrial practice
Decidability and syntactic control of interference
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
One way finite visit automata
Kleene closure and state complexity
The equivalence problem of multidimensional multitape automata
Descriptional and Computational Complexity of Finite Automata
Communication complexity method for measuring nondeterminism in finite automata
More concise representation of regular languages by automata and regular expressions
Complexity of promise problems on classical and quantum automata
Self-verifying finite automata and descriptional complexity
State complexity of four combined operations composed of union, intersection, star and reversal
Left-noncounting languages
Comparing the size of NFAs with and without \(\epsilon\)-transitions
Quasiidentities in a free semigroup
An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton
Tree acceptors and some of their applications
Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders
Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
Simple counter machines and number-theoretic problems
Finite automata capturing winning sequences for all possible variants of the \(PQ\) penny flip game
Regular language representations in the constructive type theory of Coq
Regular canonical systems
Minimisation of acyclic deterministic automata in linear time
Natural strategic ability
Testing conformance of a deterministic implementation against a non-deterministic stream X-machine
A geometrical view of the determinization and minimization of finite-state automata
Nondeterministic complexity in subclasses of convex languages
Stochastic grammars and languages
Prefix-free languages: left and right quotient and reversal
Input- or output-unary sweeping transducers are weaker than their 2-way counterparts
Alternation and bounded concurrency are reverse equivalent.
Über einen Automaten mit Pufferspeicherung
The Unmet Challenge of Timed Systems
A family of NFAs which need 2\(^{n}-\alpha\) deterministic states
Removing nondeterminism in constant height pushdown automata
The complexity of concatenation on deterministic and alternating finite automata
On the relevance of abstract algebra to control theory
Parallel program schemata
On the representation of finite deterministic 2-tape automata
On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's
Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs
Homomorphisms of algebras
Postfix automata
Construction of minimal deterministic finite automata from biological motifs
An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
Two-way unary automata versus logarithmic space
Complexity results for two-way and multi-pebble automata and their logics
Concatenation of Regular Languages and Descriptional Complexity
On stateless deterministic restarting automata
Concatenation of inputs in a two-way automaton
Pairs of complementary unary languages with ``balanced nondeterministic automata
Decision problems among the main subfamilies of rational relations
Complementing unary nondeterministic automata
Polynomial complete problems in automata theory

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)