Jumping Finite Automata: Characterizations and Complexity (Q2947412): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-22360-5_8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1132487926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4994946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transition graphs and the star-height of regular events / rank
 
Normal rank
Property / cites work
 
Property / cites work: On regularity of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parikh's theorem: a simple and direct automaton construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for determining relative star height and star height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of synchronizing operations on strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending regular expressions with iterated shuffle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shuffle languages are in P / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Exact Block Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On biautomata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commutative one-counter languages are regular / rank
 
Normal rank
Property / cites work
 
Property / cites work: JUMPING FINITE AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regulated Grammars and Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances in formal languages and applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Context-Free Languages / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:06, 10 July 2024

scientific article
Language Label Description Also known as
English
Jumping Finite Automata: Characterizations and Complexity
scientific article

    Statements

    Identifiers