Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with fl.formal-languages
Search options answers only
not deleted
user 67778
formal languages, grammars, automata theory
5
votes
Obscure characterizations of the regular languages
The following restrictions on Turing machines force them to recognize only regular languages:
space complexity $o(\log \log n)$ https://doi.org/10.1109/FOCS.1965.11
single-tape with time complexity $ …
5
votes
Notion of "quotient" or "inverse" for recognizable tree languages?
The Myhill-Nerode theorem characterizes regular/recognizable languages as those that have finitely many "quotients", and it works for trees — more precisely, a tree language is regular iff there are f …
3
votes
In the context of regular languages, must the alphabet be finite?
As already mentioned the classical theory of regular languages crucially depends on the finiteness of the alphabet. But there have been a lot of recent works on extending this to alphabets that are "s …