A Second Course in Formal Languages and Automata Theory
From MaRDI portal
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Combinatorics on words (68R15)
Recommendations
Cited in
(82)- Outfix-guided insertion
- Reducing complex CSP models to traces via priority
- Pseudo-inversion: closure properties and decidability
- Deciding path size of nondeterministic (and input-driven) pushdown automata
- Union-complexities of Kleene plus operation
- Operational union-complexity
- Translating between models of concurrency
- Lengths of words accepted by nondeterministic finite automata
- Unique decipherability in formal languages
- Site-directed insertion: language equations and decision problems
- A formalisation of the Myhill-Nerode theorem based on regular expressions
- State complexity of prefix distance
- State complexity of permutation on finite languages over a binary alphabet
- Automatic sequences and curves over finite fields
- On the language of primitive partial words
- Outfix-guided insertion (extended abstract)
- State complexity of prefix distance of subregular languages
- Prefix distance between regular languages
- Undecidability of state complexity
- State complexity of Kleene-star operations on trees
- Duplications and pseudo-duplications
- From two-way to one-way finite automata -- three regular expression-based methods
- State complexity of prefix distance
- Matrix semigroup freeness problems in \(\mathrm{SL}(2,\mathbb {Z})\)
- Vector ambiguity and freeness problems in \(\mathrm{SL} (2,\mathbb {Z})\)
- On language decompositions and primality
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
- Descriptional complexity of input-driven pushdown automata
- Periodicity in rectangular arrays
- Factorization in formal languages
- State complexity of neighbourhoods and approximate pattern matching
- Finding the growth rate of a regular or context-free language in polynomial time
- State complexity of the concatenation of regular tree languages
- scientific article; zbMATH DE number 1462097 (Why is no real title available?)
- Number of holes in unavoidable sets of partial words. II.
- General framework
- State complexity of neighbourhoods and approximate pattern matching
- scientific article; zbMATH DE number 6877055 (Why is no real title available?)
- Descriptional complexity of error detection
- Descriptional complexity of unambiguous input-driven pushdown automata
- Nondeterministic automatic complexity of overlap-free and almost square-free words
- Digit sums and vertex-labelings
- The State Complexity of Lexicographically Smallest Words and Computing Successors
- Profinite automata
- Automata, palindromes, and reversed subwords
- scientific article; zbMATH DE number 7559498 (Why is no real title available?)
- Determinisability of register and timed automata
- The range of non-linear natural polynomials cannot be context-free.
- From combinatorial games to shape-symmetric morphisms
- Remarks on separating words
- State trade-offs in unranked tree automata
- Branching measures and nearly acyclic NFAs
- State complexity of suffix distance
- Cobham’s Theorem and Automaticity
- scientific article; zbMATH DE number 7157988 (Why is no real title available?)
- Automata Theory with Modern Applications
- Languages, Decidability, and Complexity
- Nondeterministic tree width of regular languages
- Quasi-distances and weighted finite automata
- The state complexity of permutations on finite languages over binary alphabets
- Limitations of lower bound methods for deterministic nested word automata
- Consensus string problem for multiple regular languages
- Nondeterministic state complexity of site-directed insertion
- The number of languages with maximum state complexity
- State complexity of deletion and bipolar deletion
- Automatic sequences: from rational bases to trees
- Binary codes that do not preserve primitivity
- On extended boundary sequences of morphic and Sturmian words
- Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages
- Existential and universal width of alternating finite automata
- Conditional automatic complexity and its metrics
- Measuring power of commutative group languages
- Square-free word-representation of word-representable graphs
- Forgetting 1-limited automata
- Priority downward closures
- Generating b-nomial numbers
- Lower bounds for the size of deterministic unranked tree automata
- An interchange lemma for categorial dependency grammars
- Languages of words of low automatic complexity are hard to compute
- A linear-time simulation of deterministic \(d\)-limited automata
- On the joint subword complexity of automatic sequences
- A course in formal languages, automata and groups
This page was built for publication: A Second Course in Formal Languages and Automata Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549457)
