Cited in
(50)- Execution monitoring enforcement under memory-limitation constraints
- A characterization of Thompson digraphs.
- Small Extended Expressions for Acyclic Automata
- Characterization of Glushkov automata
- scientific article; zbMATH DE number 2050949 (Why is no real title available?)
- scientific article; zbMATH DE number 1839456 (Why is no real title available?)
- Multi-tilde-bar expressions and their automata
- Acyclic networks maximizing the printing complexity
- Reducing the time complexity of testing for local threshold testability
- Weak inclusion for XML types
- Reducing the time complexity of testing for local threshold testability
- Some properties of Ising automata
- How expressions can code for automata
- Obtaining shorter regular expressions from finite-state automata
- Fuzzy local languages
- Sampling different kinds of acyclic automata using Markov chains
- Families of locally testable languages
- On the hierarchy of generalizations of one-unambiguous regular languages
- Acyclic automata and small expressions using multi-tilde-bar operators
- Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet
- Efficient weighted expressions conversion
- Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order
- The bottom-up position tree automaton and the father automaton
- More concise representation of regular languages by automata and regular expressions
- AUTOMATE
- Grail
- TESTAS
- automata
- FAdo
- GUItar
- LANGAGEA
- AG
- Semigroupe
- AMoRE
- Stamina
- Euler
- scientific article; zbMATH DE number 2081053 (Why is no real title available?)
- Derivatives of rational expressions with multiplicity
- scientific article; zbMATH DE number 1962784 (Why is no real title available?)
- Position automaton construction for regular expressions with intersection
- Random generation of deterministic acyclic automata using Markov chains
- Beyond operator-precedence grammars and languages
- Automata and rational expressions
- scientific article; zbMATH DE number 7317445 (Why is no real title available?)
- Series parallel digraphs with loops
- On the descriptional complexity of stateless deterministic ordered restarting automata
- A New Family of Regular Operators Fitting with the Position Automaton Computation
- Multi-tilde Operators and Their Glushkov Automata
- Optimal estimation on the order of local testability of finite automata
- Generalizations of 1-deterministic regular languages
This page was built for software: LANGAGE
