The following pages link to THE ABSTRACT THEORY OF AUTOMATA (Q3289362):
Displaying 50 items.
- Operads, quasiorders, and regular languages (Q256333) (← links)
- Algorithms for Kleene algebra with converse (Q299194) (← links)
- Functions without short implicants. II: Construction (Q314214) (← links)
- Algebraic interpretation of a microprogram finite-state machine with datapath of transitions (Q314987) (← links)
- Optimization of circuits of compositional microprogram control units implemented on FPGA (Q464868) (← links)
- Finite-state automata in information technologies (Q464949) (← links)
- Glushkov's evidence algorithm (Q466397) (← links)
- Periodic discrete-time one-channel \(GI/G/1\) retrial queuing system with FCFS service discipline (Q466403) (← links)
- Postfix automata (Q476910) (← links)
- Extended to multi-tilde-bar regular expressions and efficient finite automata constructions (Q491616) (← links)
- Deciding determinism of regular languages (Q493651) (← links)
- On a recursive definition of a class of finite automaton functions (Q493724) (← links)
- A comment on ``Construction of fuzzy automata from fuzzy regular expressions'' (Q529060) (← links)
- Analysis and synthesis of abstract automata (Q548753) (← links)
- Partial derivatives of regular expressions and finite automaton constructions (Q672142) (← links)
- Local languages and the Berry-Sethi algorithm (Q672153) (← links)
- Automata over abstract finite quasigroups (Q681717) (← links)
- Multi-tilde-bar expressions and their automata (Q715057) (← links)
- From regular expressions to smaller NFAs (Q719325) (← links)
- Compact representations of automata for regular expression matching (Q738883) (← links)
- Obtaining shorter regular expressions from finite-state automata (Q868946) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- Analyzing the structure of a class of linear automata over a ring \(Z_{p^k}\) (Q946779) (← links)
- Generalizations of 1-deterministic regular languages (Q948081) (← links)
- A lower bound on the size of \(\varepsilon\)-free NFA corresponding to a regular expression (Q1007546) (← links)
- Representations of (M,R)-systems by categories of automata (Q1167672) (← links)
- Formalizing the logic design of register components in discrete systems (Q1264588) (← links)
- Main directions in the development of informatics (Q1280975) (← links)
- Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). II (Q1280979) (← links)
- An optimal parallel algorithm to convert a regular expression into its Glushkov automaton (Q1285572) (← links)
- Regular expressions into finite automata (Q1314367) (← links)
- The validation of SGML content models (Q1370524) (← links)
- Follow automata. (Q1426009) (← links)
- Reducing NFAs by invariant equivalences. (Q1426461) (← links)
- On complete systems of automata (Q1575734) (← links)
- An efficient null-free procedure for deciding regular language membership (Q1575893) (← links)
- Characterization of Glushkov automata (Q1575946) (← links)
- Interleaving isotactics -- an equivalence notion on behaviour abstractions (Q1643139) (← links)
- Control design for nondeterministic input/output automata (Q1662972) (← links)
- The inclusion problem for regular expressions (Q1757837) (← links)
- Construction of fuzzy automata from fuzzy regular expressions (Q1759725) (← links)
- Derivatives of rational expressions with multiplicity (Q1770384) (← links)
- Interacting automata (Q1816030) (← links)
- Representations and test planning methods for complex technical systems (Q1816104) (← links)
- Boolean function minimization in the class of disjunctive normal forms (Q1825217) (← links)
- Regular expression searching on compressed text (Q1827268) (← links)
- Canonical derivatives, partial derivatives and finite automaton constructions. (Q1853522) (← links)
- Automaton synthesis from a nonformal specification (Q1905170) (← links)
- Vacuity in practice: temporal antecedent failure (Q2018060) (← links)
- Finite automata (Q2074203) (← links)
