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